#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
constexpr double INFD = 1e100;
constexpr ll mod = 1000000007;
constexpr ll mod2 = 998244353;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll N, K;
  cin >> N >> K;
  vector<ll> A(N);
  for (int i = 0; i < (N); i++) {
    cin >> A[i];
  }
  vector<ll> S(N + 1, 0);
  for (int i = 0; i < N; i++) {
    S[i + 1] = S[i] + A[i];
  }
  ll ans = 0;
  for (int i = 0; i < N; i++) {
    for (int j = i; j < N; j++) {
      vector<vector<ll>> dp(N + 1, vector<ll>(K + 1, 0));
      dp[i][0] = 1;
      for (int k = i; k <= j; k++) {
        for (int l = 0; l <= K; l++) {
          dp[k + 1][l] += dp[k][l];
          dp[k + 1][l] %= mod2;
          if (l + A[k] > K) continue;
          dp[k + 1][l + A[k]] += dp[k][l];
          dp[k + 1][l + A[k]] %= mod2;
        }
      }
      ans += dp[j + 1][K];
      ans %= mod2;
    }
  }
  cout << ans << '\n';
  ;
  return 0;
}
