#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq


def input():
    return sys.stdin.readline()[:-1]


# sys.setrecursionlimit(1000000)

# _INPUT = """3 141
# 5 9 2

# """
# sys.stdin = io.StringIO(_INPUT)

INF = 10**10

MOD = 998244353


def comb(n, r):
    r = min(r, n - r)
    return (fact[n] * factinv[r] * factinv[n-r]) % MOD

N, M = map(int, input().split())
A = list(map(int, input().split()))


fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用

for i in range(2, M + 1):
    fact.append((fact[-1] * i) % MOD)
    inv.append((-inv[MOD % i] * (MOD // i)) % MOD)
    factinv.append((factinv[-1] * inv[-1]) % MOD)


dp = [INF] * (M+1)
dp[0] = 0

for m in range(M+1):
    for i in range(N):
        if m+A[i] <= M:
            dp[m+A[i]] = min(dp[m+A[i]], dp[m] + 1)

ans = 0
for m in range(M+1):
    if dp[m] < INF:
        # print(m, dp[N][m])
        ans = (ans + comb(M-dp[m], m-dp[m])) % MOD
print(ans)