#include <bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,m,k,x,y,ans;
int f[N],cnt[N],size[N];

int find(int x)
{
	if (f[x]==x) return x;
	return f[x]=find(f[x]);
}

int main(){
	scanf("%d%d%d",&n,&m,&k);
	for (register int i=1; i<=n; ++i) f[i]=i;
	for (register int i=1; i<=m; ++i) 
	{
		scanf("%d%d",&x,&y);
		cnt[x]++; cnt[y]++;
		int xx=find(x),yy=find(y);
		if (xx!=yy) f[xx]=yy;
	}
	for (register int i=1; i<=k; ++i)
	{
		scanf("%d%d",&x,&y);
		int xx=find(x),yy=find(y);
		if (xx==yy) cnt[x]++,cnt[y]++;
	}
	for (register int i=1; i<=n; ++i) size[find(i)]++;
	for (register int i=1; i<=n; ++i)
	{
		ans=size[find(i)]-cnt[i]-1;
		printf("%d ",ans);
	}
return 0;
}