#include <bits/stdc++.h> 
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
 #define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)

ll mod=998244353;
ll INF=1e12;
vector<ll> dp;
vector<bool> note;
vector<ll> A;
ll N,M;

ll DP(ll k) {
    if(note[k]) return dp[k];
ll s=INF;
    for(ll i=0;i<N;i++) {
        if(k-A[i]>0) {
            s=min(s,1+DP(k-A[i]));
        }
    }
    note[k]=true;
    dp[k]=s;
    return s;
}


        
        


ll mod_pow(ll x,ll n,ll mod) {
ll res=1;
  while(n>0) {
if(n&1) {
res=res*x%mod;
}
   x=x*x%mod;
    n>>=1;
  }
return res;
}

int main() {
    cin>>N>>M;
    A=vector<ll> (N);
    for(ll i=0;i<N;i++) cin>>A[i];
vector<vector<ll>> (2,vector<ll> (1e5+1));
vector<ll> up(M+1);
up[0]=1;
up[1]=1;
for(ll i=2;i<=M;i++) {
    up[i]=up[i-1]*i;
    up[i]%=mod;
}

vector<ll> b(M+1);
b[1]=1;
for(ll i=2;i<=M;i++) {
    b[i]=mod_pow(i,mod-2,mod);
}
vector<ll> r(M+1);
r[1]=1;
r[0]=1;
for(ll i=2;i<=M;i++) {
    r[i]=r[i-1]*b[i];
    r[i]%=mod;
}

note=vector<bool> (M+1,false);
dp=vector<ll> (M+1,INF);
for(ll i=0;i<N;i++) {
    dp[A[i]]=1;
    note[A[i]]=true;
}


ll ans=1;
for(ll i=M;i>0;i--) {
    ll  k=DP(i);
    if(k<INF) {
        ll a=M-k;
        ll b=i-k;
        ll count=up[a]%mod*r[a-b]%mod*r[b]%mod;
        count%=mod;
        ans+=count;
        ans%=mod;
    }
}

cout<<ans<<endl;
}