#include <bits/stdc++.h>
"
    using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX_N = 200005;
const int mod = 998244353;
struct mint {
  ll x;
  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 { 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(ll 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; }
int main() {
  int N, S;
  cin >> N >> S;
  vector<int> a(N);
  for (int i = 0; i < (N); ++i) cin >> a[i];
  vector<mint> q(S + 1);
  mint ans = 0;
  for (int n = 0; n < N; ++n) {
    vector<mint> q(S + 1);
    q[0] = 1;
    for (int m = n; m < N; ++m) {
      for (int l = S; l >= 0; --l) {
        if (a[m] + l <= S) {
          q[a[m] + l] += q[l];
        }
      }
      for (int n = 0; n <= S; ++n) {
      }
      ans += q[S];
    }
  }
  cout << ans << endl;
  return 0;
}
