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