#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>

const ll MOD = 998244353;

ll power_n(ll a, ll n, ll p) {
  if (n == 0) return 1;
  if (n == 1) return (a % p);

  ll t = power_n(a, n/2, p);

  if (n % 2 == 0) {
    return (t*t) % MOD;
  }

  ll res = (t * t) % MOD;
  res *= a;
  res %= MOD;
  return res;
}


int main() {
  int N;
  ll K;
  cin >> N >> K;

  vector<ll> A(N);

  ll sum = 0;

  rep(i, N) {
    cin >> A[i];
    sum += A[i];
    sum %= MOD;
  }


  ll ans = power_n(2, K, MOD);


  ans *= sum;
  ans %= MOD;

  cout << ans << endl;










}