#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
//using mint=modint1000000007;
using mint=modint998244353;
signed main(){
  ll N,M;cin>>N>>M;vector<ll>A(N);REP(i,N)cin>>A[i];
  vector<ll>D(M+1,1e18);D[0]=0;
  REP(i,N)REP(j,M+1-A[i])D[j+A[i]]=min(D[j]+1,D[j+A[i]]);
  mint ans=0;
  vector<mint>K(M+1,1);REP(i,M)K[i+1]=(i+1)*K[i];
  REP(i,M+1)if(D[i]!=1e18)ans+=K[M-D[i]]/K[i-D[i]]/K[M-i];
  cout<<ans.val()<<endl;
  return 0;
}