#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=30+5,M=300+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int c,n,m,A[N];
ll f[M][M][N][2],g[M][M][N][2],inv[N],pw[N],ans[M],frv[N];
void Solve(){
	scanf("%d%d",&n,&c);
	inv[0]=inv[1]=1;for(int i=2;i<=30;i++) inv[i]=(mod-inv[mod%i])*(mod/i)%mod;
	for(int i=frv[0]=1;i<=30;i++) frv[i]=frv[i-1]*inv[i]%mod;
	for(int i=pw[0]=1;i<=n;i++) pw[i]=pw[i-1]*inv[n]%mod;
	f[0][0][0][0]=inv[n];
	for(int i=1;i<=n;i++){
		int z;scanf("%d",&z);
		for(int x=0;x<=m;x++) for(int y=0;y<=x;y++) Mc(g[x][y],f[x][y]),Me(f[x][y],0);
		for(int x=0;x<=m;x++) for(int y=0;y<=x;y++) for(int j=0;j<i;j++) for(int o:{0,1}) if(g[x][y][j][o]){
			// gdb(g[x][y][j][o]*4%mod,i,x,y,j,o);
			(f[x+z][y][j+1][o]+=g[x][y][j][o])%=mod;
			for(int h=0;h<z;h++){
				ll w=frv[h]*pw[h]%mod;
				(f[x+z][y+h][j][o]+=(mod-w)*g[x][y][j][o])%=mod;
				if(i>c) (f[x+h][y+h][j][o]+=w*g[x][y][j][o])%=mod;
				if(!o&&h>=(i<=c?z-1:0)) (f[x+h][y+h][j][1]+=w*g[x][y][j][0])%=mod;
			}
		}
		m+=z;
	}
	for(int j=0;j<n;j++){
		static ll dp[M];
		dp[0]=n*inv[n-j]%mod;
		for(int i=1;i<=m;i++){
			dp[i]=n;
			for(int h=1;h<=i;h++){
				dp[i]=(dp[i]+dp[h-1]*j)*h%mod;
			}
			dp[i]=dp[i]*inv[n-j]%mod;
		} 
		for(int x=0;x<m;x++) for(int y=0;y<=x;y++) ans[x+1]+=f[x][y][j][1]*dp[y]%mod;
	}
	for(int i=1;i<=m;i++) printf("%lld%c",ans[i]%mod," \n"[i==m]);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}