#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define ff              first
#define ss              second
#define int             long long
#define pb              push_back
#define mp              make_pair
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             998244353
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define w(x)            int x; cin>>x; while(x--)
#define pw(b,p)         pow(b,p) + 0.1
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;


void c_p_c()
{
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}

int dp[3001][3001];
int presum[3001][3001];
int arr[3001];

int32_t main()
{
	c_p_c();
	int n, s; cin >> n >> s;

	for (int i = 1; i <= n; ++i)
		cin >> arr[i];

	dp[1][arr[1]] = 1;
	presum[1][arr[1]] = 1;

	for (int i = 2; i <= n; ++i)
	{
		for (int j = 1; j <= s; ++j)
		{
			dp[i][j] = dp[i - 1][j];

			//include i vala case;
			if (j == arr[i])
				dp[i][j] += i;

			else if (j > arr[i])
				dp[i][j] += dp[i - 1][j - arr[i]];

			presum[i][j] = presum[i - 1][j] + dp[i][j];
			presum[i][j] %= mod;
		}
	}

	/*for (int i = 1; i <= n; ++i)
		cout << dp[i][s] - dp[i - 1][s] << '\n';*/

	//cout << dp[2][0] << '\n';

	cout << presum[n][s] << '\n';

	return 0;
}