#include<bits/stdc++.h>
using namespace std;
const int N=2e3+5,mod=998244353;
int tid,n,x,a[N];
namespace work1
{
	const int N=16,M=(1<<15)+5;
	int g[N][M],h[N][M],g1[M],h1[M],f[M][N],to[N],ans[N];
	void solve()
	{
		for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(a[i]>=j)to[i-1]|=(1<<j-1);
		for(int i=0;i<n;i++)g[i][1<<i]=1,h[i][1<<i]=1;
		for(int i=1;i<(1<<n);i++)for(int j=0;j<n;j++)if(g[j][i])
		{
			g1[i]=(g1[i]+g[j][i])%mod;
			for(int k=0;k<n;k++)if((i>>k&1^1) && (to[j]>>k&1))g[k][i^(1<<k)]=(g[k][i^(1<<k)]+g[j][i])%mod;
		}
		for(int i=1;i<(1<<n);i++)for(int j=0;j<n;j++)if(h[j][i])
		{
			int lim=__builtin_ctz(i);if(to[j]>>lim&1)h1[i]=(h1[i]+h[j][i])%mod;
			for(int k=lim;k<n;k++)if((i>>k&1^1) && (to[j]>>k&1))h[k][i^(1<<k)]=(h[k][i^(1<<k)]+h[j][i])%mod;
		}
		f[0][0]=1;
		for(int i=1;i<(1<<n);i++)
		{
			int low=__builtin_ctz(i),now=i^(1<<low);
			for(int j=now;;j=(j-1)&now)
			{
				int num=__builtin_popcount(j)+1;
				for(int k=num-1;k<=n;k++)f[i][k]=(f[i][k]+1ll*f[now^j][k-num+1]*g1[j^(1<<low)])%mod;
				for(int k=num;k<=n;k++)f[i][k]=(f[i][k]+1ll*f[now^j][k-num]*h1[j^(1<<low)]%mod*x)%mod;
				if(!j)break;
			}
		}
		for(int i=0;i<=n;i++)printf("%d ",f[(1<<n)-1][i]);printf("\n");
	}
}
int main()
{
	//freopen("story.in","r",stdin);
	//freopen("story.out","w",stdout);
	scanf("%d %d %d",&tid,&n,&x);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	if(n<=15){work1::solve();return 0;}
	return 0;
}