"""

dp[v] = v個置くときの、回数の最小

"""

import sys
from sys import stdin

def modfac(n, MOD):
 
    f = 1
    factorials = [1]
    for m in range(1, n + 1):
        f *= m
        f %= MOD
        factorials.append(f)
    inv = pow(f, MOD - 2, MOD)
    invs = [1] * (n + 1)
    invs[n] = inv
    for m in range(n, 1, -1):
        inv *= m
        inv %= MOD
        invs[m - 1] = inv
    return factorials, invs


def modnCr(n,r):

    return fac[n] * inv[n-r] * inv[r] % mod


N,M = map(int,stdin.readline().split())

A = list(map(int,stdin.readline().split()))

mod = 998244353
fac,inv = modfac(2*10**5,mod)

dp = [float("inf")] * (M+1)

A.sort()
A.reverse()

dp[0] = 0

for na in A:
    for i in range(0,M+1-na):

        dp[i+na] = min(dp[i+na] , dp[i] + 1)

ans = 0
for i in range(M+1):

    if dp[i] != float("inf"):

        peace = i - dp[i]
        emp = M - dp[i]
        now = modnCr(emp,peace)

        ans += now

        #print (i,now)

print (ans % mod)