#include <bits/stdc++.h>
using namespace std;
using namespace placeholders;
using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<vector<int> >;
using VS = vector<string>;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair<int, int>;
using VPII = vector<pair<int, int> >;
template <typename T = int>
using VT = vector<T>;
template <typename T = int>
using VVT = vector<vector<T> >;
template <typename T = int>
using LIM = numeric_limits<T>;
template <typename T>
inline istream &operator>>(istream &s, vector<T> &v) {
  for (T &t : v) {
    s >> t;
  }
  return s;
}
template <typename T>
inline ostream &operator<<(ostream &s, const vector<T> &v) {
  for (int i = 0; i < int(v.size()); ++i) {
    s << (" " + !i) << v[i];
  }
  return s;
}
void in_impl(){};
template <typename T, typename... TS>
void in_impl(T &head, TS &...tail) {
  cin >> head;
  in_impl(tail...);
}
template <typename T>
inline T fromString(const string &s) {
  T res;
  istringstream iss(s);
  iss >> res;
  return res;
}
template <typename T>
inline string toString(const T &a) {
  ostringstream oss;
  oss << a;
  return oss.str();
}
template <typename T>
inline bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
constexpr int MOD = 998244353;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(12) << fixed;
  int N, S;
  in_impl(N, S);
  ;
  VI A(N);
  cin >> A;
  static int dp[4096][4096][2];
  for (int i = (int)(0); i < (int)(N); ++i) {
    (dp[i + 1][A[i]][1] += i + 1) %= MOD;
    for (int j = (int)(0); j < (int)(4096); ++j) {
      for (int k = (int)(0); k < (int)(2); ++k) {
        (dp[i + 1][j][0] += dp[i][j][k]) %= MOD;
        if (j + A[i] < 4096) {
          (dp[i + 1][j + A[i]][1] += dp[i][j][k]) %= MOD;
        }
      }
    }
  }
  int res = 0;
  for (int i = (int)(0); i < (int)(N); ++i) {
    (res += LL(dp[i + 1][S][1]) * (N - i)) %= MOD;
  }
  cout << res << endl;
  return 0;
}
