#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
const int inf = 1034567891;
const long long LL_INF = 1234567890123456789ll;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
template <typename T>
T GCD(T a, T b) {
  long long t;
  while (a) {
    t = a;
    a = b % a;
    b = t;
  }
  return b;
}
template <typename T>
string toString(T a) {
  return to_string(a);
}
template <typename T>
void toInt(string s, T& x) {
  stringstream str(s);
  str >> x;
}
inline int add(int x, int y) {
  x += y;
  if (x >= mod) x -= mod;
  return x;
}
inline int sub(int x, int y) {
  x -= y;
  if (x < 0) x += mod;
  return x;
}
inline int mul(int x, int y) { return (x * 1ll * y) % mod; }
inline int powr(int a, long long b) {
  int x = 1 % mod;
  while (b) {
    if (b & 1) x = mul(x, a);
    a = mul(a, a);
    b >>= 1;
  }
  return x;
}
inline int inv(int a) { return powr(a, mod - 2); }
const int N = 3e3 + 5;
int dp[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  mod = 998244353;
  int n, s;
  cin >> n >> s;
  vector<int> vec;
  int v;
  vec.push_back(0);
  for (int i = 0; i < n; i++) {
    cin >> v;
    vec.push_back(v);
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    memset(dp, false, sizeof(dp));
    dp[0] = 1;
    for (int j = i; j <= n; j++) {
      int req = s - (vec[i] + vec[j]) + (i == j) * vec[i];
      if (req >= 0 && req <= s && dp[req]) {
        ans = add(ans, mul(dp[req], mul(i, n - j + 1)));
      }
      if (i == j) continue;
      for (int l = N - vec[j] - 1; l >= 0; l--) {
        if (dp[l]) dp[l + vec[j]] = add(dp[l + vec[j]], 1);
      }
    }
  }
  cout << ans << '\n';
  return 0;
}
