#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <cassert>
using namespace std;

#define EPS 1e-12
#define ull unsigned long long
#define ll long long
#define VI vector<ll>
#define PII pair<ll, ll> 
#define VVI vector<vector<ll> >
#define VVVI vector<vector<vector<ll>>>
#define VVVVI vector<vector<vector<vector<ll>>>>
#define REP(i,n) for(ll i=0,_n=(n);(i)<(ll)_n;++i)
#define REPR(i,n) for(ll i=(ll)(n)-1;0<=(i);--i)
#define RANGE(i,a,b) for(ll i=(ll)a,_b=(ll)(b);(i)<_b;++i)
#define RANGER(i,a,b) for(ll i=(ll)(b)-1,_a=(ll)(a);(_a)<=i;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP(a, b) make_pair(a, b)
#define POPCOUNT __builtin_popcount
#define POPCOUNTLL __builtin_popcountll
#define CLEAR(table, v) memset(table, v, sizeof(table));
#define UNIFORM_DOUBLE(a, b) (((b-a)*(double)rand()/RAND_MAX)+a) // [a, b) 
#define UNIFORM_LL(a, b) (ll)UNIFORM_DOUBLE(a, b) // [a, b) 
#define IN(v, lo, hi) ((lo)<=(v) && (v)<(hi))
#define DD(v) cout<<#v<<": "<<v<<endl
#define FI first
#define SE second
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const map<T0, T1>& v) { for( typename map<T0, T1>::const_iterator p = v.begin(); p!=v.end(); p++ ){os << p->first << ": " << p->second << " ";} return os; }
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const pair<T0, T1>& v) { os << v.first << ": " << v.second << " "; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << " "; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const set<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const deque<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<vector<T> >& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << endl; } return os; }
template<typename T>void maxUpdate(T& a, T b) {a = max(a, b);}
template<typename T>void minUpdate(T& a, T b) {a = min(a, b);}

#define MOD 1000000007LL
#define INF (1LL<<60)

struct modll {
	static const ll MODVAL;
	ll val;
	modll() : val(0) {}
	modll(ll v) : val(v) { normalize(); }
	void normalize() { val = (val+MODVAL) % MODVAL; }
	modll  operator+ (ll v) { return modll(val+v); }
	modll& operator+=(ll v) { val+=v; normalize(); return *this; }
	modll  operator- (ll v) { return modll(val-v); }
	modll& operator-=(ll v) { val-=v; normalize(); return *this; }
	modll  operator* (ll v) { return modll(val*v); }
	modll& operator*=(ll v) { val*=v; normalize(); return *this; }
	modll  operator^ (ll e) { modll x(val); modll v(1); for(;e;x=x*x,e>>=1) if(e&1) v = v * x; return v; } // pow
	modll inv() { modll x(val); return x^(MODVAL-2); } // MODVAL must be prime number when use this!
	static modll inv(ll v) { return modll(v).inv(); }
	operator ll() { return val; }
};
const ll modll::MODVAL = 998244353LL;
std::ostream& operator<<(std::ostream& os, const modll& v) { os << v.val; return os; }

/*
LがきまるとN^2で求まる。Lが1こずれたときの関係、なんとかならないか?
	f(L)がわかってたとしてf(L+1)は?
	Lで何も選ばないでL+1の状態になったということ
なにか事前計算しておいてL,Rが決まったときにO(1)で計算して全体N^2でいけないか?
wの初期値{w[0], ..., w[S]} に対してそれを使ったansの式が立てられる?
ans = k*w
*/
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll N,S;
	while(cin>>N>>S) {
		VI A(N);
		REP(i, N) cin>>A[i];
		modll ans = 0LL;

		vector<vector<vector<modll>>> dp(N+1, vector<vector<modll>>(S+1, vector<modll>(3)));
		dp[0][0][0] = 1;
		REP(i, N) {
			REP(si, S+1) {
				dp[i+1][si][0] += dp[i][si][0];
				dp[i+1][si][1] += dp[i][si][0] + dp[i][si][1];
				dp[i+1][si][2] += dp[i][si][0] + dp[i][si][1] + dp[i][si][2];
				ll nsi = si+A[i];
				if(nsi<S+1) {
					dp[i+1][nsi][1] += dp[i][si][0] + dp[i][si][1];
					dp[i+1][nsi][2] += dp[i][si][0] + dp[i][si][1];
				}
			}
		}
//		DD(dp);
		ans = dp[N][S][2];

//		vector<modll> w(S);
//		REP(i, N) {
//			w[0]=i+1;
//			REPR(si, S) {
//				if(si+A[i]==S) {
//					ans += w[si] * (N-i);
//				}
//				if(si+A[i]<S) {
//					w[si+A[i]] += w[si];
//				}
//			}
//		}

//		REP(i, N) {
//			DD(i);
//			vector<modll> w(S+1);
//			w[0]=1;
//			RANGE(j, i, N) {
//				vector<modll> nw(w);
//				REP(si, S+1) {
//					ll ni = si+A[j];
//					if(ni<S+1) nw[ni] += w[si];
//				}
//				w = nw;
//				DD(w);
//				ans += w[S];
//			}
//		}
		cout<<ans<<endl;
	}
	
	return 0;
}


Measured memory_bytes: 493056