#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<stack>
#include<algorithm>
#include<map>
#include<vector>
#define ll long long
#define lowbit(x) x&-x
using namespace std;
const int mod=998244353;
int n,m,a[50005];
ll f[5005][5005],C[5005][5005],ans[5005],sum[5005];
int main(){
	scanf("%d%d",&n,&m);
	ll tot=1;
	for(int i=1;i<=n;++i) tot=tot*2LL%mod;
	C[0][0]=1;
	for(int i=1;i<=n;++i){
		C[i][0]=1;
		for(int j=1;j<=i;++j) C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;
	}
	for(int i=1;i<=n;++i) scanf("%d",&a[i]);
	sort(a+1,a+n+1);
	reverse(a+1,a+n+1);
	f[0][0]=1;
	sum[0]=1;
	for(int i=1;i<=n;++i){
		ll s=0;
		for(int j=0;j<m;++j){
			f[i][j]=f[i-1][j];
			if(j-a[i]>=0) f[i][j]+=f[i-1][j-a[i]];
			f[i][j]%=mod;
			sum[i]+=f[i][j];
			sum[i]%=mod;
		}
		s=sum[i]-sum[i-1];
		s=(s%mod+mod)%mod;
		for(int j=0;j<=n;++j){
			ans[j]=(ans[j]+s*C[n-i][j])%mod;
		}
	}
	tot--;
	for(int i=0;i<=n;++i){
		ans[i]=(tot-ans[i]+mod)%mod;
		tot-=C[n][i+1];
		printf("%lld\n",ans[i]);
	}
}