#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double

using namespace std;

mt19937 rng(time(NULL));

const int mod=998244353;
int add(int a,int b){
	a+=b;
	if(a>=mod)a-=mod;
	return a;
}
int sub(int a,int b){
	a-=b;
	if(a<0)a+=mod;
	return a;
}
int mul(int a,int b){
	return((ll)a*b)%mod;
}
int pwrmod(int x,int k){
	int ans=1;
	for(;k;k>>=1,x=mul(x,x))
		if(k&1)ans=mul(ans,x);
	return ans;
}
const int N=3001;
int fact[N],ifact[N];
int nck(int n,int k){
	if(n<k||n<0||k<0)return 0;
	return mul(fact[n],mul(ifact[k],ifact[n-k]));
}
int main()
{
	fact[0]=1;
	for(int i=1;i<N;i++)fact[i]=mul(fact[i-1],i);
	for(int i=0;i<N;i++)ifact[i]=pwrmod(fact[i],mod-2);
	int n,m;
	cin >> n >> m;
	vector<int> a(n+1);
	for(int i=1;i<=n;i++)cin >> a[i];
	sort(a.begin()+1,a.end());
	reverse(a.begin()+1,a.end());
	vector dp(n+1,vector(m+1,0));
	vector<int> ans(n+1);
	dp[0][0]=1;
	for(int i=1;i<=n;i++){
		int mys=0;
		for(int j=max(0,m-a[i]);j<=m;j++){
			mys=add(mys,dp[i-1][j]);
		}
		//printf("%i: %i %i\n",i,mys,a[i]);
		for(int k=0;k<=n;k++){
			ans[k]=add(ans[k],mul(mys,nck(n-i,k)));
		}
		for(int j=0;j<m;j++){
			dp[i][j]=dp[i-1][j];
			if(j>=a[i]){
				dp[i][j]=add(dp[i][j],dp[i-1][j-a[i]]);
			}
		}
		dp[i][m]=add(dp[i-1][m],mys);
	}
	for(int i=0;i<=n;i++)printf("%i\n",ans[i]);
	return 0;
}

answer.code: In function ‘int main()’:
answer.code:54:16: error: missing template arguments before ‘dp’
   54 |         vector dp(n+1,vector(m+1,0));
      |                ^~
answer.code:56:9: error: ‘dp’ was not declared in this scope
   56 |         dp[0][0]=1;
      |         ^~