#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;
using ll = long long;

//const int mod = 1e9 + 7;
const int mod = 998244353;
const int INF = 100100100;

ll gcd(ll a , ll b){
    if(a < b)swap(a , b);
    if(a % b == 0)return b;
    else return gcd(b , a % b);
}

ll modpow (ll a , ll b , ll m) {
    ll ret = 1;
    while (b > 0) {
        if (b & 1) {
            ret *= a;
            ret %= m;
        }
        a = a * a;
        a %= m;
        b >>= 1;
    }
    return ret;
}

int main(){
    int n; ll k;
    cin >> n >> k;
    vector<int> a(n);
    ll sum = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum += a[i];
        sum %= mod;
    }
    ll ans = modpow((ll)2 , k , mod) * sum % mod;
    cout << ans << '\n';
    return 0;
}