#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
ll n, s;
ll a[3010];
ll f[3010];
ll inv2;
ll ksm(ll aa, ll b) {
	ll ret = 1;
	while (b) {
		if (b & 1) ret = (ret * aa) % MOD;
		aa = (aa * aa) % MOD;
		b >>= 1;
	}
	return ret;
}
int main() {
	cin >> n >> s;
	for (ll i = 1; i <= n; i++) cin >> a[i];
	inv2 = ksm(2, MOD - 2);
	f[0] = ksm(2, n);
	for (ll i = 1; i <= n; i++) {
		for (ll k = s; k >= a[i]; k--) {
			f[k] = (f[k] + f[k - a[i]] * inv2) % MOD;
		}
	}
	cout << f[s];
	return 0;
}