#include<bits/stdc++.h>
using namespace std;

const int N = 1e5;

int n,m,k;

int par[N+5];
int sz[N+5];

int find_par(int x){
	if(par[x] == x) return x;
	return par[x] = find_par(par[x]);
}

vector<int> fri[N+5];
vector<int> ene[N+5];

int main(){
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<=n;i++){
		par[i] = i;
		sz[i] = 1;
	}
	for(int i=1;i<=m;i++){
		int x,y;
		scanf("%d%d",&x,&y);
		fri[x].push_back(y);
		fri[y].push_back(x);
		int pu = find_par(x);
		int pv = find_par(y);
		if(pu == pv) continue;
		par[pu] = pv;
		sz[pv] += sz[pu];
	}
	for(int i=1;i<=k;i++){
		int x,y;
		scanf("%d%d",&x,&y);
		int pu = find_par(x);
		int pv = find_par(y);
		if(pu!=pv) continue;
		ene[x].push_back(y);
		ene[y].push_back(x);
	}
	for(int i=1;i<=n;i++){
		if(i>1) printf(" ");
		int pi = find_par(i);
		printf("%d",sz[pi] - fri[i].size() - ene[i].size() - 1);
	}
	printf("\n");
	return 0;
}
