#pragma GCC optimize ("O3")

#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...)  cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif

void d_err() {
    cerr << endl;
}

template <typename H, typename... T>
void d_err(H h, T... t) {
    cerr << h << " ";
    d_err(t...);
}

template <typename T>
void print(T x) {
    cout << x << endl;
}

#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;

ll INF = 1e16;
int inf = 1e9;
ll MOD = 998244353;

struct mint {
    ll x; // typedef long long ll;
    mint(ll x=0):x((x%MOD+MOD)%MOD){}
    mint operator-() const { return mint(-x);}
    mint& operator+=(const mint a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += MOD-a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint operator+(const mint a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    // for prime MOD
    mint inv() const {
        return pow(MOD-2);
    }
    mint& operator/=(const mint a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint a) const {
        mint res(*this);
        return res/=a;
    }
};

ostream& operator << (ostream& os, const mint a) {
    os << a.x;

    return os;
}

mint dp[3030][3030][3];

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    
    int N, S;
    cin >> N >> S;

    vi A(N);
    REP(i, N) cin >> A[i];

//    dp[0][0][0] = 1;
//    REP(i, N) {
//        REP(j, S + 1) {
//            dp[i + 1][j][0] += dp[i][j][0];
//            dp[i + 1][j][1] += dp[i][j][0] + dp[i][j][1];
//            dp[i + 1][j][2] += dp[i][j][0] + dp[i][j][1] + dp[i][j][2];
//            if (j + A[i] <= S) {
//                dp[i + 1][j + A[i]][1] += dp[i][j][0] + dp[i][j][1];
//                dp[i + 1][j + A[i]][2] += dp[i][j][0] + dp[i][j][1];
//            }
//        }
//    }

    dp[0][0][0] = 1;
    REP(i, N) {
        REP(j, S + 1) {
            dp[i+1][j][0] += dp[i][j][0];
            dp[i+1][j][1] += dp[i][j][1];
            dp[i+1][j][2] += dp[i][j][2];

            if(j + A[i] <= S) {
                dp[i+1][j + A[i]][1] += dp[i][j][0] * (i + 1) + dp[i][j][1];
                if (j + A[i] == S) dp[i+1][j + A[i]][2] += (dp[i][j][1]) * (N - i) + dp[i][j][0] * (i + 1) * (N - i);
            }
        }
    }

    print(dp[N][S][2]);

}


Measured memory_bytes: 218812