#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int mod = 998244353;
const int N = 3010;

ll fpow(ll a, ll b) {
    ll res = 1;
    while (b > 0) {
        if (b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

ll dp[N];

int main() {
    int n, s; cin >> n >> s;
    int inv2 = fpow(2 ,mod - 2);
    dp[0] = fpow(2, n);
    for (int i = 0; i < n; i++) {
    	int x; cin >> x;
    	for (int j = s; j >= x; j--)
    		dp[j] = (dp[j] + dp[j - x] * inv2) % mod;
    }
    cout << dp[s] << "\n";
}