import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N, S;
    scan(N, S);
    auto A = aryread();
    auto dp = new long[][][](3, N + 1, S + 2);
    dp[0][0][0] = 1;
    immutable m = 998244353;
    foreach (i; 0 .. N)
    {
        dp[0][i + 1][0] = 1;
        foreach (j; 0 .. S + 1)
        {
            dp[1][i + 1][j] += dp[0][i][j] + dp[1][i][j];
            dp[1][i + 1][j] %= m;
            dp[1][i + 1][min(S + 1, j + A[i])] += dp[0][i][j] + dp[1][i][j];
            dp[1][i + 1][min(S + 1, j + A[i])] %= m;

            dp[2][i + 1][j] += dp[2][i][j] + dp[1][i][j];
            dp[2][i + 1][j] %= m;
            dp[2][i + 1][min(S + 1, j + A[i])] += dp[1][i][j] + dp[0][i][j];
            dp[2][i + 1][min(S + 1, j + A[i])] %= m;
        }
    }
    writeln(dp[2][N][S]);
}
