N, M = map(int, input().split())
A = list(map(int, input().split()))
MOD = 998244353

INF = 10**9
dp = [INF]*(M+1)
dp[0] = 0
for a in A:
    for i in range(M+1):
        if i+a > M:
            break
        dp[i+a] = min(dp[i+a], dp[i]+1)

f = [1]*(M+1)
inv = [1]*(M+1)
finv = [1]*(M+1)
for i in range(2, M+1):
    f[i] = f[i-1]*i % MOD
    inv[i] = MOD-(inv[MOD % i]*(MOD//i) % MOD)
    finv[i] = finv[i-1]*inv[i] % MOD


def comb(n, m):
    if not 0 <= m <= n:
        return 0
    return f[n]*finv[m] % MOD*finv[n-m] % MOD


ans = 0
for i in range(M+1):
    v = dp[i]
    if v == INF:
        continue
    ans += comb(M-v, i-v)
    ans %= MOD

print(ans)