#include <bits/stdc++.h>
using namespace std;
const long long maxx = 1e9 + 7;
bool compare(const pair<long long, long long> &a,
             const pair<long long, long long> &b) {
  return a.first < b.first || (a.first == b.first && a.second < b.second);
}
long long inline power(long long a, long long b, long long p) {
  a %= p;
  long long ans = 1;
  while (b > 0) {
    if (b & 1) ans = (ans * a) % p;
    a = (a * a) % p;
    b >>= 1;
  }
  return ans;
}
long long inv(long long n, long long p) { return power(n, p - 2, p); }
inline vector<long long> allinv(long long n, long long p) {
  vector<long long> arr(n);
  arr[1] = 1;
  for (long long i = (2); i < (n); i += 1) {
    arr[i] = (p - (p / i) * arr[p % i] % p) % p;
  }
  return arr;
}
vector<long long> inline allncr(long long n, long long p) {
  vector<long long> nci(n + 1);
  nci[0] = 1;
  nci[n] = 1;
  vector<long long> v = allinv(n, p);
  for (long long i = (1); i < (n); i += 1) {
    nci[i] = (nci[i - 1] * (n - i - 1)) % p;
  }
  return nci;
}
bool inline isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
template <class T>
void printv(T &v) {
  long long n = v.size();
  for (long long i = 0; i < n; i++) cout << v[i] << " ";
  cout << "\n";
}
long long longestPrefixSuffix(string s) {
  long long n = s.length();
  long long lps[n];
  lps[0] = 0;
  long long len = 0, i = 1;
  while (i < n) {
    if (s[i] == s[len]) {
      len++;
      lps[i] = len;
      i++;
    } else {
      if (len != 0)
        len = lps[len - 1];
      else
        lps[i] = 0, i++;
    }
  }
  long long res = lps[n - 1];
  return (res > n / 2) ? n / 2 : res;
}
bool pal(string x) {
  string a = x;
  reverse(a.begin(), a.end());
  return a == x;
}
void solve() {
  int n, s;
  cin >> n >> s;
  vector<int> v(n);
  for (long long i = 0; i < n; i++) cin >> v[i];
  map<int, vector<pair<int, int> > > m;
  if (v[0] <= s) m[v[0]].push_back({0, 0});
  for (long long i = 1; i < n; i++) {
    map<int, vector<pair<int, int> > > temp;
    if (v[i] > s) continue;
    for (auto &x : m) {
      if (x.first + v[i] <= s) {
        for (auto &l : x.second) {
          temp[(x.first + v[i])].push_back({l.first, i});
        }
      }
    }
    for (auto &tt : temp) {
      for (auto &ee : tt.second) {
        m[tt.first].push_back(ee);
      }
    }
    m[v[i]].push_back({i, i});
  }
  long long ans = 0;
  long long maxc = 998244353;
  for (auto &a : m[s]) {
    ans = (ans + ((a.first + 1) * (n - a.second)) % maxc) % maxc;
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long test = 1;
  while (test--) {
    solve();
  }
}
