#include <bits/stdc++.h>
using namespace std;
long long modpow(long long x, long long y,
                 long long m = (long long)(998244353)) {
  long long res = 1;
  while (y) {
    if (y % 2) {
      res *= x;
      res %= m;
    }
    x = x * x % (long long)(998244353);
    y /= 2;
  }
  return res;
}
long long mypow(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y % 2) {
      res *= x;
    }
    x = x * x;
    y /= 2;
  }
  return res;
}
bool prime(long long x) {
  for (long long i = 2; i * i <= x; i++) {
    if (!(x % i)) {
      return false;
    }
  }
  return true;
}
inline long long gcd(long long x, long long y) {
  if (!y) {
    return x;
  }
  return gcd(y, x % y);
}
long long keta(long long x) {
  long long ans = 0;
  while (x) {
    x /= 10;
    ans++;
  }
  return ans;
}
long long ketasum(long long x) {
  long long ans = 0;
  while (x) {
    ans += x % 10;
    x /= 10;
  }
  return ans;
}
inline long long lcm(long long x, long long y) {
  long long ans = x / gcd(x, y) * y;
  return ans;
}
long long twobeki(long long x) {
  long long ans = 0;
  while (1) {
    if (!(x & 1)) {
      ans++;
      x /= 2;
    } else {
      break;
    }
  }
  return ans;
}
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
class modInt {
  long long value, modulo;

 public:
  modInt() : value(0), modulo((long long)(998244353)) { value = 0; }
  template <typename T>
  modInt(T value = 0, long long modulo = (long long)(998244353))
      : value(value), modulo(modulo) {
    if (value < 0) {
      value = -value;
      value %= modulo;
      value = -value;
      value += modulo;
    }
    this->value = value % modulo;
  }
  inline operator long long() const { return value; }
  inline modInt& operator+=(modInt x) {
    value += x.value;
    if (value >= modulo) value -= modulo;
    return *this;
  }
  inline modInt& operator++() {
    if (value == modulo - 1)
      value = 0;
    else
      value++;
    return *this;
  }
  inline modInt& operator-() const { return modInt(0) -= *this; }
  inline modInt& operator-=(modInt x) {
    value -= x.value;
    if (value < 0) value += modulo;
    return *this;
  }
  inline modInt& operator--() {
    if (value == 0)
      value = modulo - 1;
    else
      value--;
    return *this;
  }
  inline modInt& operator*=(modInt x) {
    value = value * x.value % modulo;
    return *this;
  }
  inline modInt& operator/=(modInt x) { return operator*=(x.inv()); }
  inline modInt inv() { return modpow(*this, modulo - 2); }
  template <typename T>
  modInt operator+(T x) {
    return modInt(*this) += x;
  }
  template <typename T>
  modInt& operator+=(T x) {
    return operator+=(modInt(x, modulo));
  }
  template <typename T>
  modInt operator-(T x) {
    return modInt(*this) -= x;
  }
  template <typename T>
  modInt& operator-=(T x) {
    return operator-=(modInt(x, modulo));
  }
  template <typename T>
  modInt operator*(T x) {
    return modInt(*this) *= x;
  }
  template <typename T>
  modInt& operator*=(T x) {
    return operator*=(modInt(x, modulo));
  }
  template <typename T>
  modInt operator/(T x) {
    return modInt(*this) /= x;
  }
  template <typename T>
  modInt& operator/=(T x) {
    return operator/=(modInt(x, modulo));
  }
};
istream& operator>>(istream& ist, modInt& x) {
  long long a;
  ist >> a;
  x = a;
  return ist;
}
long long n, s, a[3004], dp[3004], ans;
signed main() {
  cin >> n >> s;
  for (long long i = 0; i < n; i++) {
    scanf("%lld", &a[i]);
  }
  dp[0] = 1;
  for (long long i = 0; i < n; i++) {
    for (long long j = s - a[i]; j >= 0; j--) {
      if (!j) {
        dp[a[i]] += dp[0] * (i + 1) % (long long)(998244353);
      } else {
        dp[j + a[i]] += dp[j];
      }
    }
    ans += dp[s];
    ans %= (long long)(998244353);
  }
  cout << ans % (long long)(998244353) << endl;
}
