N,M,X=list(map(int,input().split()))
path=[]
for i in range(10):
    path.append([0]*10)
for i in range(M):
    u,v=list(map(int,input().split()))
    u-=1
    v-=1
    if u==v:
      path[u][v]+=1
    else:
      path[u][v]+=1
      path[v][u]+=1
MOD=998244353

dp=[]
for i in range(X+1):
	dp.append([0]*((N+1)*N))
dp[0][N**2]=1
for i in range(X):
	for j in range((N+1)*N):
	  if dp[i][j]==0:
	    continue
	  prev=j//N
	  now=j%N
	  if prev!=N:
	    if path[prev][now]==0:
	      continue
	    B=sum(path[now])-1
	    if B==0:
	      dp[i+1][N**2+now]=(dp[i+1][N**2+now]+dp[i][j])%MOD
	      continue
	    else:
	      Binv=pow(B,MOD-2,MOD)
	      for k in range(N):
	        dp[i+1][now*N+k]=(dp[i+1][N**2+now]+dp[i][j]*Binv*(path[now][k]-1*(prev==k)))%MOD
	  else:
	    B=sum(path[now])
	    if B==0:
	      dp[i+1][N**2+now]=(dp[i+1][N**2+now]+dp[i][j])%MOD
	      continue
	    else:
	      Binv=pow(B,MOD-2,MOD)
	      for k in range(N):
	        dp[i+1][now*N+k]=(dp[i+1][N**2+now]+dp[i][j]*Binv*(path[now][k]))%MOD
#print(dp)
#print(path)
for i in range(N):
  ans=0
  for j in range(N+1):
    ans=(ans+dp[X][N*j+i])%MOD 
  print(ans)