n,m=map(int,input().split())
a=list(map(int,input().split()))
X=10**10
q=[X]*(m+1)
q[0]=0
for v in a:
  for i in range(m+1):
    if i-v>=0:
      q[i]=min(q[i],q[i-v]+1)
M=998244353
fa=[1,1]
fb=[1,1]
for i in range(2,m+1):
  fa+=[fa[-1]*i%M]
  fb+=[fb[-1]*(M//i)*fb[M%i]*fa[M%i-1]*(-1)%M]
fc=lambda n,k:fa[n]*fb[k]*fb[n-k]%M if n>=k else 0
g=(q[0]<X)+(q[m]<X)
for i in range(1,m):
  if q[i]<X:
    g+=fc(m-q[i],i-q[i])
    g%=M
print(g)