#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 998244353;
template <class T, class U>
T pow_mod(T a,T b,U m){
	if(b == 0)return 1;
	else if(b % 2 == 0){
		ll t = pow_mod(a,b/2,m);
		return t * t % m;
	}
	return a  * pow_mod(a,b-1,m) % m;
}


int main() {
	int N;
	ll K;
	cin >> N >> K;
	ll sum = 0;
	for(int i = 0;i < N;i++){
		ll A;
		cin >> A;
		sum += A;
		sum %= MOD;
	}

	ll mul = pow_mod(2LL,K,MOD);
	cout << sum * mul % MOD << endl;
}