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

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int n, k, mx = 0;
    const int mod = 998244353;

    priority_queue<int, vector<int>, greater<int>> q;
    cin >> n >> k;
    int ans = 0;
    for (int i = 1; i <= n; i++) {
    	int x;
    	cin >> x;
    	mx = max(mx, x);
    	q.push(x);
    	(ans += x) %= mod;
    }

    auto ksm = [&](int a, int x) -> int {
    	int s = 1;
    	while (x) {
    		if (x & 1) s = s * a % mod;
    		a = a * a % mod;
    		x >>= 1;
    	}
    	return s;
    };
    while (q.top() * 2 < mx && k) {
    	int u = q.top();
    	q.pop();
    	q.push(2 * u % mod);
    	(ans += u) %= mod;
    	k--;
    }

    ans = ans * ksm(2, k / n) % mod;
    k %= n;

    while (k && q.size()) {
    	k--;
    	(ans += q.top()) %= mod;
    	q.pop();
    }

    cout << ans << "\n";
    return 0;
}