#include <bits/stdc++.h>
#include <chrono> 
 
using namespace std;
using namespace std::chrono; 
 
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define f0r(a, b) for (long long a = 0; a < (b); a++)
#define f1r(a, b, c) for (long long a = (b); a < (c); a++)
#define f0rd(a, b) for (long long a = (b); a >= 0; a--)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); a--)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(NULL); cout.tie(NULL);}
#define fix(prec) {cout << setprecision(prec) << fixed;}
#define mp make_pair
#define f first
#define s second
#define presum(p, a, n) {p[0] = a[0]; for (int i = 1; i < (n); i++) p[i] = a[i] + p[i-1];}
#define all(v) v.begin(), v.end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < (n); ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define aout(a, lb, rb) {for (int ele = (lb); ele <= (rb); ele++) { if (ele > (lb)) cout << " "; cout << a[ele]; } cout << '\n';}
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
 
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
 
// template<typename A, typename B> ll max(A x, B y) {
//   return x > y ? x : y;
// }
// template<typename A, typename B> ll min(A x, B y) {
//   return x < y ? x : y;
// }
 
mt19937 rng(steady_clock::now().time_since_epoch().count());
/* usage - just do rng() */
 
void usaco(string filename) {
  // #pragma message("be careful, freopen may be wrong")
	freopen((filename + ".in").c_str(), "r", stdin);
	freopen((filename + ".out").c_str(), "w", stdout);
}
 
const lld pi = 3.14159265358979323846;
// const ll mod = 1000000007;
const ll mod = 998244353;
// ll mod;



ll n, m, k, q, l, r, x, y, z;
ll a[1000005];
ll b[1000005];
ll c[1000005];
string s, t;
ll ans = 0;

ll dp[3005][3005];
ll sum[3005];

inline void inc(ll& a, ll x) {
  a += x;
  if (a >= mod) a -= mod;
}

void rec(int l, int r) {
  if (l == r) {
    if (a[l] == k) inc(ans, 1);
    return;
  }

  int m = (l + r) / 2;
  f1r(i, l, r + 1) f1r(j, 1, k + 1) dp[i][j] = 0;

  // left
  inc(dp[m][a[m]], 1);
  f1rd(i, m - 1, l) {
    inc(dp[i][a[i]], 1);
    f1r(j, 1, k + 1 - a[i]) inc(dp[i][j + a[i]], dp[i + 1][j]);
    f1r(j, 1, k + 1) inc(dp[i][j], dp[i + 1][j]);
  }
  f0r(i, k + 1) {
    sum[i] = 0;
    f1r(j, l, m + 1) inc(sum[i], dp[j][i]);
  }

  // right
  inc(dp[m + 1][a[m + 1]], 1);
  f1r(i, m + 2, r + 1) {
    inc(dp[i][a[i]], 1);
    f1r(j, 1, k + 1 - a[i]) inc(dp[i][j + a[i]], dp[i - 1][j]);
    f1r(j, 1, k + 1) inc(dp[i][j], dp[i - 1][j]);
  }

  ll lspan = m - l + 1;
  // combine
  f1r(i, m + 1, r + 1) {
    f1r(j, 1, k) {
      ll v = dp[i][j];
      v = (v * sum[k - j]) % mod;
      inc(ans, v);
    }
    inc(ans, (dp[i][k] * lspan) % mod);
    inc(ans, sum[k]);
  }

  // ao(sum, k + 1);

  rec(l, m); rec(m + 1, r);
}

void solve() {
  cin >> n >> k;
  ai(a, n);

  rec(0, n - 1);

  cout << ans << '\n';
}

int main() {
  send help

  // usaco("file");
  
  int tc;
  tc = 1;
  // cin >> tc;
  while (tc--) solve();
} 

Measured memory_bytes: 73984