#include <bits/stdc++.h>
using namespace std;
bool RELAXED = false;
template <int, typename T>
struct MINMAX {
  T val;
  MINMAX(T val) : val(val) {}
};
template <typename T>
MINMAX<1, T> MAX(T val) {
  return MINMAX<1, T>(val);
};
template <typename T>
MINMAX<2, T> MIN(T val) {
  return MINMAX<2, T>(val);
};
template <typename T, typename U>
inline T& operator|=(T& lhs, MINMAX<1, U> rhs) {
  return lhs = (rhs.val > lhs ? (RELAXED = true, rhs.val)
                              : (RELAXED = false, lhs));
}
template <typename T, typename U>
inline T& operator|=(T& lhs, MINMAX<2, U> rhs) {
  return lhs = (rhs.val < lhs ? (RELAXED = true, rhs.val)
                              : (RELAXED = false, lhs));
}
template <typename T>
inline vector<T> readVector(int n) {
  vector<T> vec(n);
  for (int i = 0; i < int(n); i++) cin >> vec[i];
  return vec;
}
template <typename T>
void EXIT(T answer) {
  cout << answer << endl;
  exit(0);
}
const int MOD = 998244353;
int dp[3005];
signed long long int ans = 0;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int n, S;
  cin >> n >> S;
  vector<int> a = readVector<int>(n);
  for (int i = 0; i < int(n); i++) {
    memset(dp, 0, sizeof dp);
    dp[0] = 1;
    for (int j = int(i); j <= int(n - 1); j++) {
      for (int s = int(S); s >= int(0); --s) {
        int sai = s + a[j];
        if (sai <= S) {
          dp[sai] += dp[s];
          dp[sai] %= MOD;
        }
      }
      ans += dp[S];
      ans %= MOD;
    }
  }
  cout << ans << endl;
}
