N, M = map(int,input().split())
a = list(map(int,input().split()))
INF = (1<<31)
dp = [INF]*(M+1)
dp[0] = 0
for i in range(M):
    for j in range(N):
        if i + a[j] <= M:
            dp[i+a[j]] = min(dp[i+a[j]],dp[i]+1)

MOD = 998244353
fac = [1]
for i in range(1,M+1):
    fac.append((fac[-1]*i)%MOD)
faci = [pow(fac[-1],MOD-2,MOD)]
for i in reversed(range(1,M+1)):
    faci.append((faci[-1]*i)%MOD)
faci = list(reversed(faci))

def binom(n,r):
    if n < 0 or r < 0 or n < r:
        return 0
    return (fac[n]*faci[r]*faci[n-r])%MOD
ans = 0
for i in range(M+1):
    if dp[i] == INF:
        continue
    ans += binom(M-dp[i],i-dp[i])

ans%=MOD
print(ans)