#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define ve vector
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
const int mod = 998244353;
int main(){
    int n, s;
    cin >> n >> s;
    ve<int> a(n);
    rep(i,n) cin >> a[i];
    ve<ve<ll>> dp(n+1, ve<ll>(s+1));
    dp[0][0] = 1;
    rep(i,n){
        rep(j,s+1){
            (dp[i+1][j] += dp[i][j] * 2) %= mod;
            if(j+a[i]<=s){
                (dp[i+1][j+a[i]] = dp[i][j]) %= mod;
            }
        }
    }
    cout << dp[n][s] << endl;
    return 0;
}