n,m = map(int,input().split())
A = list(map(int,input().split()))
mod = 998244353

fact = [1,1]
finv = [1,1]
inv = [0,1]
 
for i in range(2,m+5):
    fact.append((fact[-1]*i)%mod)
    inv.append((inv[mod%i]*(mod-mod//i))%mod)
    finv.append((finv[-1]*inv[-1])%mod)
 
def nCr(n,r,mod):
    if r > n:
        return 0
    else: 
        return fact[n]*finv[r]%mod*finv[n-r]%mod


dp = [m+1]*(m+1)
dp[0] = 0
for a in A:
    for i in range(m):
        if i+a > m:
            break
        dp[i+a] = min(dp[i+a],dp[i]+1)
ans = 0
for i in range(m+1):
    if dp[i] == m+1:
        continue
    ans += nCr(m-dp[i],i-dp[i],mod)
    ans %= mod
print(ans)