# Original solution
import sys
def main():
    input = sys.stdin.readline
    N,S = list(map(int, input().split()))
    A = list(map(int, input().split()))

    dp0 = [[Mint() for _ in range(S+3001)] for _ in range(N+1)]
    dp1 = [[Mint() for _ in range(S+3001)] for _ in range(N+1)]
    dp2 = [[Mint() for _ in range(S+3001)] for _ in range(N+1)]
    dp0[0][0] += 1
    for i in range(N):
        a = A[i]
        dp0i = dp0[i]
        dp1i = dp1[i]
        dp2i = dp2[i]
        dp0n = dp0[i+1]
        dp1n = dp1[i+1]
        dp2n = dp2[i+1]
        for j in range(S+1):
            dp0ij = dp0i[j]
            dp1ij = dp1i[j]
            dp1nja = dp1n[j+a]
            dp2nja = dp2n[j+a]

            dp0n[j] += dp0ij
            dp1nja += dp0ij * (i+1)
            dp2nja += dp0ij * (i+1) * (N-i)

            dp1n[j] += dp1ij
            dp1nja += dp1ij
            dp2nja += dp1ij * (N-i)

            dp2n[j] += dp2i[j]
    print((dp2[N][S]))

MOD = 998244353
class Mint:
    def __init__(self, value=0):
        self.value = value % MOD
        if self.value < 0: self.value += MOD

    @staticmethod
    def get_value(x): return x.value if isinstance(x, Mint) else x

    def inverse(self):
        a, b = self.value, MOD
        u, v = 1, 0
        while b:
            t = a // b
            b, a = a - t * b, b
            v, u = u - t * v, v
        if u < 0: u += MOD
        return u

    def __repr__(self): return str(self.value)
    def __eq__(self, other): return self.value == other.value
    def __neg__(self): return Mint(-self.value)
    def __hash__(self): return hash(self.value)
    def __bool__(self): return self.value != 0

    def __iadd__(self, other):
        self.value += Mint.get_value(other)
        if self.value >= MOD: self.value -= MOD
        return self
    def __add__(self, other):
        new_obj = Mint(self.value)
        new_obj += other
        return new_obj
    __radd__ = __add__

    def __isub__(self, other):
        self.value -= Mint.get_value(other)
        if self.value < 0: self.value += MOD
        return self
    def __sub__(self, other):
        new_obj = Mint(self.value)
        new_obj -= other
        return new_obj
    def __rsub__(self, other):
        new_obj = Mint(Mint.get_value(other))
        new_obj -= self
        return new_obj

    def __imul__(self, other):
        self.value = self.value * Mint.get_value(other) % MOD
        return self
    def __mul__(self, other):
        new_obj = Mint(self.value)
        new_obj *= other
        return new_obj
    __rmul__ = __mul__

    def __ifloordiv__(self, other):
        other = other if isinstance(other, Mint) else Mint(other)
        self *= other.inverse()
        return self
    def __floordiv__(self, other):
        new_obj = Mint(self.value)
        new_obj //= other
        return new_obj
    def __rfloordiv__(self, other):
        new_obj = Mint(Mint.get_value(other))
        new_obj //= self
        return new_obj

if __name__ == '__main__':
    main()

# Optimized solution
import sys
def main():
    input = sys.stdin.readline
    N,S = list(map(int, input().split()))
    A = list(map(int, input().split()))
    MOD = 998244353

    dp0 = [[0 for _ in range(S+1)] for _ in range(N+1)]
    dp1 = [[0 for _ in range(S+1)] for _ in range(N+1)]
    dp2 = [[0 for _ in range(S+1)] for _ in range(N+1)]
    dp0[0][0] += 1
    for i in range(N):
        a = A[i]
        dp0i = dp0[i]
        dp1i = dp1[i]
        dp2i = dp2[i]
        dp0n = dp0[i+1]
        dp1n = dp1[i+1]
        dp2n = dp2[i+1]
        for j in range(S+1):
            dp0n[j] = (dp0n[j] + dp0i[j]) % MOD
            dp1n[j] = (dp1n[j] + dp1i[j]) % MOD
            dp2n[j] = (dp2n[j] + dp2i[j]) % MOD

            if j+a > S: continue
            dp1n[j+a] = (dp1n[j+a] + dp1i[j] + (dp0i[j] * (i+1))) % MOD
            dp2n[j+a] = (dp2n[j+a] + (dp1i[j] * (N-i)) + (dp0i[j] * (i+1) * (N-i))) % MOD

    print((dp2[N][S]))

if __name__ == '__main__':
    main()