#include using namespace std; using ll = long long; using ull = unsigned long long; #define rep(i,n) for(int i=0; i<(int)(n); i++) #define MOD 1000000007 #define MOD2 998244353 #define INF 1000000007 #define LINF 1000000000000000007LL #define PI 3.14159265359 #define P pair template inline bool chmax(T &a, const T &b){ if(a inline bool chmin(T &a, const T &b){ if(a>b) {a=b; return true;} else return false; } struct Edge{ int to; ll cost; Edge(int to, ll cost) : to(to), cost(cost) {} }; typedef vector Edges; typedef vector Graph; void add_edge(Graph &g,int from,int to,ll cost,bool rev,ll rev_cost){ g[from].push_back(Edge(to,cost)); if(rev) g[to].push_back(Edge(from,rev_cost)); } ll dp[100005]; int a[110]; const int MAX = 510000; // 5*(10^5) ll fac[MAX], finv[MAX], inv[MAX]; void init(int m) { fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (int i = 2; i < MAX; i++){ fac[i] = fac[i - 1] * i % m; inv[i] = m - inv[m%i] * (m / i) % m; finv[i] = finv[i - 1] * inv[i] % m; } } ll nCk(int n, int k,int m){ if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * (finv[k] * finv[n - k] % m) % m; } ll nPk(int n, int k, int m){ if(n < k) return 0; if(n < 0 || k < 0) return 0; return fac[n]*finv[n-k]%m; } void solve(){ int n,m; cin>>n>>m; rep(i,n) cin>>a[i]; rep(i,m+1) dp[i]=INF; dp[0]=0; for(int k=0; k<=m; k++)rep(i,n){ if(k-a[i]>=0) chmin(dp[k],dp[k-a[i]]+1); } init(MOD2); ll ans=0; for(int k=0; k<=m; k++){ if(dp[k]!=INF) ans += nCk(m-dp[k],k-dp[k],MOD2); ans %=MOD2; } cout<