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

using ll = long long;
static const ll MOD = 998244353;

ll power(ll x, ll n) {
  ll res = 1;
  while (n > 0) {
    if (n & 1LL) {
      res *= x;
      res %= MOD;
    }
    x = (x * x) % MOD;
    n >>= 1;
  }
  return res;
}

ll modinv(ll x) {
  return power(x, MOD - 2);
}

int main() {
  ll n, k;
  cin >> n >> k;
  
  vector<ll> a(n);
  ll sum = 0;
  for (int i = 0; i < n; i++) {
    cin >> a.at(i);
    sum += a.at(i);
  }
  sum %= MOD;
  
  cout << (sum * power(2, k)) % MOD << endl;
}