#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353;
int n,s;
int a[3005];
ll mem[3005][3005];
ll ans = 0;
ll dp(int id, int W){
    if (id == 0) return (W == 0);
    if (mem[id][W] != -1) return mem[id][W];
    ll res = 2*dp(id-1,W);
    if (W >= a[id]) {
        res += dp(id-1,W-a[id]);
    }
    res %= mod;
    return mem[id][W] = res;
}
int main(){
    scanf("%d%d",&n,&s);
    for (int i = 1; i <= n; i++){
        scanf("%d",&a[i]);
    }
    sort(a+1,a+n+1);
    memset(mem,-1,sizeof(mem));
    printf("%lld", dp(n,s));

}
