import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 998244353
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""
N,S = m()

a = l()

dp = [0 for i in range(3000+1)]

dp[0] = 1
for i in range(N):
    if i == 0:
        dp[a[i]] += 1
    else:
        po = [0 for j in range(3000+1)]
        for j in range(1,3000+1):
            po[j] += dp[j]
        for j in range(S+1,a[i]+1,-1):
            po[j] += dp[j-a[i]] * (N-i)
        if S == a[i]:
            po[S] += 1
        for j in range(3000+1):
            dp[j] += po[j]
            dp[j] %= mod



print(dp[S])
