#define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;

template<class T> bool chmin(T &a, T b) {if(a>b){a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b){a=b;return 1;}return 0;}
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}

const ll INF = 1LL << 60;
const ll MOD = 998244353;
const double pi = 3.14159265358979;

ll modpow(ll a,ll n){
    ll res = 1;
    while (n > 0){
        if (n & 1) res = res * a % MOD;
        a = a * a % MOD;
        n >>= 1;
    }
    return res;
    //a^n modを返す
    //グローバル変数:MOD
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    ll n,k;
    cin >> n >> k;

    ll sum = 0;

    vector<ll> a(n);
    for (ll i = 0;i < n;i++){
        cin >> a[i];
        sum += a[i];
        sum %= MOD;
    }

    ll x = modpow(2, k);

    ll ans = (sum * x) % MOD;

    cout << ans << endl;
}