// dfmt off
T lread(T=long)(){return readln.chomp.to!T;}T[] lreads(T=long)(long n){return iota(n).map!((_)=>lread!T).array;}
T[] aryread(T=long)(){return readln.split.to!(T[]);}void arywrite(T)(T a){a.map!text.join(' ').writeln;}
void scan(L...)(ref L A){auto l=readln.split;foreach(i,T;L){A[i]=l[i].to!T;}}alias sread=()=>readln.chomp();
void dprint(L...)(lazy L A){debug{auto l=new string[](L.length);static foreach(i,a;A)l[i]=a.text;arywrite(l);}}
enum MOD=10^^9+7;alias PQueue(T,alias l="b<a")=BinaryHeap!(Array!T,l);import std;
// dfmt on

void main()
{
    long N, S;
    scan(N, S);
    auto MOD = 998244353;
    auto A = aryread();
    auto dp = new long[long][][](N + 1, S + 2);
    dp[0][0][0] = 1;

    foreach (i; 0 .. N)
        foreach (j; 0 .. S + 1)
        {
            // dprint(i, j, dp[i][j]);
            foreach (k, v; dp[i][j])
            {
                dp[i + 1][j][k] = dp[i + 1][j].get(k, 0) + v;
                dp[i + 1][min(j + A[i], S + 1)][k + 1] = dp[i + 1][min(j + A[i], S + 1)].get(k + 1,
                        0) + v;
            }
        }
    // writeln(dp[N][S]);
    long ans;
    foreach (k, v; dp[N][S])
    {
        long tmp = powmod(2, N - k, MOD);
        ans += (tmp * v) % MOD;
        ans %= MOD;
    }
    writeln(ans);
}

/// x^^n % m
T powmod(T = long)(T x, T n, T m = 10 ^^ 9 + 7)
{
    if (n < 1)
        return 1;
    if (n & 1)
    {
        return x * powmod(x, n - 1, m) % m;
    }
    T tmp = powmod(x, n / 2, m);
    return tmp * tmp % m;
}
