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

#define all(v) v.begin(),v.end()
using ll = long long;
using ull = unsigned long long;
using vll=vector<ll>;
using vvll = vector<vector<ll>>;
const ll INF=1ll<<60;
using vp=vector<pair<ll, ll>>;
ll mod=998244353;

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

int main(){
    ll N,K;
    cin>>N>>K;
    vll A(N);
    ll sum=0;
    for(int i=0;i<N;i++){
        cin>>A[i];
        sum+=A[i];
    }

    cout << sum*powmod(2,K,mod)%mod << endl;
}