#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001
struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};

int main(){
	
	int N,M;
	cin>>N>>M;
	
	vector<int> A(N);
	rep(i,N)cin>>A[i];
	
	vector dp(M+1,Inf);
	dp[0] = 0;
	
	rep(i,M){
		rep(j,N){
			if(i+A[j]<=M){
				dp[i+A[j]] = min(dp[i+A[j]],dp[i]+1);
			}
		}
	}
	combi C(300000);
	mint ans= 0;
	rep(i,M+1){
		if(dp[i]==Inf)continue;
		
		ans += C.combination(M-dp[i], i-dp[i]);
	}
	cout<<ans.val()<<endl;
	
	
	return 0;
}