## https://yukicoder.me/problems/no/1693

MOD = 998_244_353
MAX_INT = 10 ** 18


class CombinationCalculator:
    """
    modを考慮したPermutation, Combinationを計算するためのクラス
    """    
    def __init__(self, size, mod):
        self.mod = mod
        self.factorial = [0] * (size + 1)
        self.factorial[0] = 1
        for i in range(1, size + 1):
            self.factorial[i] = (i * self.factorial[i - 1]) % self.mod
        
        self.inv_factorial = [0] * (size + 1)
        self.inv_factorial[size] = pow(self.factorial[size], self.mod - 2, self.mod)

        for i in reversed(range(size)):
            self.inv_factorial[i] = ((i + 1) * self.inv_factorial[i + 1]) % self.mod

    def calc_combination(self, n, r):
        if n < 0 or n < r or r < 0:
            return 0

        if r == 0 or n == r:
            return 1
        
        ans = self.inv_factorial[n - r] * self.inv_factorial[r]
        ans %= self.mod
        ans *= self.factorial[n]
        ans %= self.mod
        return ans
    
    def calc_permutation(self, n, r):
        if n < 0 or n < r:
            return 0

        ans = self.inv_factorial[n - r]
        ans *= self.factorial[n]
        ans %= self.mod
        return ans
        

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

    dp = [MAX_INT] * (M + 1)
    dp[0] = 0
    for i in range(M + 1):
        for a in A:
            if i + a <= M:
                dp[i + a] = min(dp[i + a], dp[i] + 1)
    
    combi = CombinationCalculator(M, MOD)

    answer = 0
    for i in range(M + 1):
        x = dp[i]
        if x < MAX_INT:
            a = combi.calc_combination(M - x, i - x)
            answer += a
            answer %= MOD
    print(answer)



    


        

    



if __name__ == "__main__":
    main()