// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2")
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	unsigned int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x<o.x?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,modint b){return a.x==b.x;}
	friend bool operator !=(modint a,modint b){return a.x!=b.x;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 10000006
#define inf 0x3f3f3f3f

int n,c,a[maxn];
modint f[305][305][32][2],res[305];

signed main()
{
	n=read(),c=read(); initC(305);
	For(i,1,n)a[i]=read();
	f[0][0][0][0]=1;
	int s1=0,s2=0,s3=0;
	For(u,1,n){
		int x=a[u];
		Rep(i,s1,0) Rep(j,s2,0) Rep(k,s3,0) Rep(o,1,(u>c)) if(f[i][j][k][o].x){
			modint w=f[i][j][k][o];
			f[i][j][k][o]=0;
			if(!o) f[i+x-1][j+x-1][k][1]+=w*ifac[x-1];
			if(u<=c) {
				f[i+x][j+x][k][o]+=w*ifac[x];
				f[i][j+x][k+1][o]+=w;
				For(p,0,x)
					f[i+p][j+x][k][o]-=w*ifac[p];
			}else{
				f[i][j+x][k+1][1]+=w;
				For(p,0,x){
					f[i+p][j+p][k][1]+=w*ifac[p];
					f[i+p][j+x][k][1]-=w*ifac[p];
				}
			}
		}
		s1+=x,s2+=x,s3+=1;
	}
	modint ivn=iv[n];
	For(i,0,s1) For(j,0,s2) For(k,0,s3) if(f[i][j][k][1].x){
		modint w=f[i][j][k][1];
		w*=ivn;
		if(k==0){
			w*=fac[i]*qpow(ivn,i);
		}else{
			w*=fac[i]*n;
			w*=qpow(n-k,(mod-1)-(i+1));
		}
		res[j+1]+=w;
	}
	For(i,1,s1){
		res[i]+=res[i-1];
		cout<<res[i].x<<" ";
	}
	return 0;
}
/*

*/