#include<iostream>
#include<cstdio>
#define N 501
#define K 26
#define M 300
#define mod 998244353
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int fast_pow(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int n,m,k,a[N+1][K+1],fac[K+1],invfac[K+1],ans[N+1],A[N+1],B[N+1],dp[K+1][M+1],DP[N+1][K+1][M+1],res[N+1];
int main()
{
	int cnt;
	fac[0]=1;
	for (int i=1;i<=K;++i) fac[i]=1ll*fac[i-1]*i%mod;
	invfac[K]=fast_pow(fac[K],mod-2);
	for (int i=K-1;i>=0;--i) invfac[i]=1ll*invfac[i+1]*(i+1)%mod;
	n=read(),m=read(),k=read();
	for (int i=1;i<=n;++i)
	{
		for (int j=0;j<=m;++j)
			for (int t=0;t<=k;++t)
				dp[j][t]=0;
		dp[0][0]=1,cnt=0;
		for (int j=1;j<=m;++j)
		{
			a[i][j]=read();
			if (a[i][j])
			{
				cnt++;
				for (int t=cnt;t>=1;--t)
					for (int s=a[i][j];s<=k;++s)
						Adder(dp[t][s],dp[t-1][s-a[i][j]]);
			}
		}
		for (int j=1;j<=m;++j)
			if (a[i][j])
			{
				for (int t=1;t<=cnt;++t)
					for (int s=a[i][j];s<=k;++s)
						Adder2(dp[t][s],-dp[t-1][s-a[i][j]]);
				for (int t=0;t<=cnt-1;++t)
					for (int s=0;s<=k-a[i][j];++s)
						Adder(DP[i][j][s+a[i][j]],1ll*dp[t][s]*fac[t]%mod*fac[cnt-1-t]%mod*invfac[cnt]%mod);
				for (int t=cnt;t>=1;--t)
					for (int s=a[i][j];s<=k;++s)
						Adder(dp[t][s],dp[t-1][s-a[i][j]]);
			}
	}
	for (int i=1;i<=m;++i)
	{
		for (int j=1;j<=n;++j) res[j]=1;
		for (int j=0;j<=k;++j)
		{
			if (j)
			{
				for (int t=1;t<=n;++t) Adder2(res[t],-DP[t][i][j-1]);
			}
			A[0]=B[n+1]=1;
			for (int t=1;t<=n;++t) A[t]=1ll*A[t-1]*res[t]%mod;
			for (int t=n;t>=1;--t) B[t]=1ll*B[t+1]*res[t]%mod;
			for (int t=1;t<=n;++t) Adder(ans[t],1ll*A[t-1]*B[t+1]%mod*DP[t][i][j]%mod);
		}
	}
	for (int i=1;i<=n;++i) printf("%d\n",ans[i]);
	return 0;
}