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

const ll MOD = 998244353;

// a^n mod を計算する
ll modpow(ll a, ll n, ll mod) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    int N;
    ll K;
    cin >> N >> K;
    ll A[N];
    ll sum = 0;
    for (int i = 0; i < N; i++) {
        cin >> A[i];
        sum += A[i];
    }
    ll ans = (sum % MOD) * modpow(2, K, MOD);
    cout << (ans) % MOD << "\n";
    return 0;
}