#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
const int mod = 998244353;
struct mint {
  long long x;
  mint(long long 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 { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(long long t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  mint inv() const { return pow(mod - 2); }
  mint& operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
long long N, S;
vector<long long> A;
mint dp[3010][3010][3];
int main() {
  cin >> N >> S;
  A.resize(N);
  for (int i = 0; i < (N); ++i) cin >> A[i];
  dp[0][0][0] = 1;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j <= S; j++) {
      dp[i + 1][j][0] += dp[i][j][0];
      dp[i + 1][j + A[i]][1] += dp[i][j][0] * (i + 1);
      dp[i + 1][j + A[i]][2] += dp[i][j][0] * (i + 1) * (N - i);
      dp[i + 1][j][1] += dp[i][j][1];
      dp[i + 1][j + A[i]][2] += dp[i][j][1] * (N - i);
      dp[i + 1][j][2] += dp[i][j][2];
    }
  }
  cout << dp[N][S][2] << endl;
}
