import sys
input = sys.stdin.buffer.readline
#input = sys.stdin.readline
import copy

def cmb(n, r, p):
  if (r < 0) or (n < r):
    return 0
  r = min(r, n - r)
  ret = fac[n] * finv[r] % p
  ret = ret * finv[n-r] % p
  return ret

def perm(n,r,p):
  if (r < 0) or (n < r):
    return 0
  return fac[n]*finv[n-r]%p

n = 3*pow(10,5)
MOD = 998244353

fac = [-1]*(n+1); fac[0] = 1; fac[1] = 1 #階乗
finv = [-1]*(n+1); finv[0] = 1; finv[1] = 1 #階乗の逆元
inv = [-1]*(n+1); inv[0] = 0; inv[1] = 1 #逆元
for i in range(2,n+1):
  fac[i] = fac[i-1]*i%MOD
  inv[i] = MOD - inv[MOD%i]*(MOD//i)%MOD
  finv[i] = finv[i-1]*inv[i]%MOD

def main():
    n,m = map(int,input().split()); INF = pow(10,18)
    A = list(map(int,input().split()))
    #A = [a-1 for a in A]
    A.sort()
    #dp[i]: 全部でi個選ぶのに必要な最小操作回数
    dp = [INF]*(m+1)
    dp[0] = 0
    for i in range(n):
        #p = copy.copy(dp)
        #p,dp = dp,p
        a = A[i]
        for j in range(m+1):
            if j+A[i] <= m:
                dp[j+A[i]] = min(dp[j+A[i]], dp[j] + 1)
    #print(dp)
    ans = 0
    for p in range(m+1):
        x = dp[p]
        temp = cmb(m-x,p-x,MOD)
        ans += temp
        ans %= MOD
    print(ans)

if __name__ == '__main__':
    main()