#include using namespace std; using ll = long long; template using vec = vector; template using vvec = vector>; template bool chmin(T& a,T b){if(a>b) {a = b; return true;} return false;} template bool chmax(T& a,T b){if(a=0;i--) #define all(x) (x).begin(),(x).end() #define debug(x) cerr << #x << " = " << (x) << endl; constexpr ll mod = 998244353; struct mint { ll x; mint(ll x=0):x((x%mod+mod)%mod){} friend ostream &operator<<(ostream& os,const mint& a){ return os << a.x; } friend istream &operator>>(istream& is,mint& a){ ll t; is >> t; a = mint(t); return (is); } mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; } mint operator+(const mint a) const { mint res(*this); return res+=a; } mint operator-(const mint a) const { mint res(*this); return res-=a; } mint operator*(const mint a) const { mint res(*this); return res*=a; } mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod mint inv() const { return pow(mod-2); } mint& operator/=(const mint a) { return (*this) *= a.inv(); } mint operator/(const mint a) const { mint res(*this); return res/=a; } bool operator==(const mint a)const{ return x==a.x; } }; int main(){ cin.tie(0); ios::sync_with_stdio(false); int N; ll K; cin >> N >> K; mint sum = 0; rep(i,N){ mint a; cin >> a; sum += a; } cout << (((mint) 2).pow(K))*sum << "\n"; }