from operator import mul
from functools import reduce

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

n,m=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
inf=10**8+1
mod=998244353

DP=[inf]*(m+1)
DP[0]=0
for j in range(0,m):
    for i in range(n):
        if j+A[i]<=m:
            DP[j+A[i]]=min(DP[j+A[i]],DP[j]+1)
        else:
            break
ans=0
for i in range(m+1):
    if DP[i]==inf:
        continue
    ans=(ans+cmb(m-DP[i],i-DP[i]))%mod
print(ans)