#include<bits/stdc++.h>
using namespace std;
constexpr int N=18,M=1<<18;
int n,m,k,lim,low,ans[N],f[N][M],g[M],dp[M][101],tmp1[M];
pair<int,int>pre[N][101],tmp2[M];
int read(){
	int x=0;char ch=getchar();
	while (!isdigit(ch)) ch=getchar();
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x;
}
int main(){
	n=read();m=read();k=read();lim=1<<n;
	for (int i=1;i<=m;i++){int x,y;
		x=read()-1;y=read()-1;
		f[x][1<<y]++;f[y][1<<x]++;
	}
	for (int i=0;i<n;i++)
		for (int s=1;s<lim;s++)
			f[i][s]=f[i][s^(s&-s)]+f[i][s&-s];
	for (int s=0;s<lim;s++)
		low=s&-s,g[s]=g[s^low]+f[__lg(low)][s];
	memset(dp,-0x3f,sizeof(dp));dp[0][0]=0;
	for (int s=0;s<lim;s++){
		int siz=__builtin_popcount(s);
		for (int i=siz;i<=k;i++)
			if (dp[s][i-siz]+g[s]>dp[s][i])
				dp[s][i]=dp[s][i-siz]+g[s],pre[s][i]={s,i-siz};
		for (int i=0;i<n;i++)
			if (~s>>i&1)
				for (int j=0;j<=k;j++)
					if (dp[s][j]>dp[s^1<<i][j])
						dp[s^1<<i][j]=dp[s][j],pre[s^1<<i][j]={s,j};
	} pair<int,int>nxt;
	for (int i=1,t=lim-1,j=k;j;i++,t=nxt.first,j=nxt.second){
		nxt=pre[t][j];
		if (nxt.second!=j)
			for (int i=0;i<n;i++)
				if (t>>i&1) ans[i]++;
	}
	for (int i=0;i<n;i++) printf("%d ",ans[i]);
	return 0;
}