#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using intpair = pair<int, int>;
using llpair = pair<ll, ll>;
using llvec = vector<ll>;
using llmat = vector<vector<ll>>;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
ll gcd(ll a, ll b) {
  if (a == 0 || b == 0) return 0;
  if (a < b) swap(a, b);
  ll tmp = a % b;
  while (tmp != 0) {
    a = b;
    b = tmp;
    tmp = a % b;
  }
  return b;
}
ll factorial(ll x) {
  ll f = 1;
  for (ll i = 2; i < x; i++) {
    f *= i;
  }
  return f;
}
ll nPr(ll n, ll r) {
  ll result = 1;
  for (ll i = r + 1; i <= n; i++) result *= i;
  return result;
}
ll nCr(ll n, ll r) {
  if (n == r) {
    return 1;
  }
  if (r > n) {
    return 0;
  }
  if (r > n / 2) {
    r = n - r;
  }
  if (n == 0) {
    return 0;
  }
  if (r == 0) {
    return 1;
  }
  if (r == 1) {
    return n;
  }
  double result = 1;
  for (double i = 1; i <= r; i++) {
    result *= (n - i + 1) / i;
  }
  return (ll)result;
}
bool IsPrime(ll num) {
  if (num < 2)
    return false;
  else if (num == 2)
    return true;
  else if (num % 2 == 0)
    return false;
  double sqrtNum = sqrt(num);
  for (ll i = 3; i <= sqrtNum; i += 2) {
    if (num % i == 0) {
      return false;
    }
  }
  return true;
}
ll GreaterBinarySearch(ll* array, ll key, ll max, ll min) {
  if (array[max] < array[min]) {
    return NULL;
  } else {
    ll mid = max + (min - max) / 2;
    if (array[mid] < key) {
      return GreaterBinarySearch(array, key, max, mid - 1);
    }
    if (array[mid] > key) {
      return GreaterBinarySearch(array, key, mid + 1, min);
    } else {
      return mid;
    }
  }
}
int main() {
  int N, S;
  cin >> N >> S;
  int ruiseki[N + 1];
  int A[N];
  ruiseki[0] = 0;
  for (int i = 0; i < N; i++) {
    cin >> A[i];
    ruiseki[i + 1] = ruiseki[i] + A[i];
  }
  ll dp[N][N];
  ll result = 0LL;
  for (int i = 0; i < N; i++) {
    dp[i][i] = (A[i] == S ? 1 : 0);
    result += dp[i][i];
  }
  for (int dist = 1; dist < N; dist++) {
    for (int i = 0; i + dist < N; i++) {
      dp[i][i + dist] = dp[i][i + dist - 1] + dp[i + 1][i + dist];
      dp[i][i + dist] += (ruiseki[i + dist + 1] - ruiseki[i] == S ? 1 : 0);
      result += dp[i][i + dist];
      result %= 998244353;
    }
  }
  cout << result << endl;
}
