#include <cstdio>
#include <vector>
using namespace std;
vector<int> a[100000];
int c[100000], col = 0, s[100000];
void dfs(int cur){
	c[cur] = col;
	s[col]++;
	for (auto e : a[cur]){
		if (c[e] == -1) dfs(e);
	}
}
int main(){
	int n, m, k, x, y;
	scanf("%d %d %d", &n, &m, &k);
	int f[n];
	fill(f, f + n, -1);
	for (int i = 0; i < m; i++){
		scanf("%d %d", &x, &y);
		a[x - 1].emplace_back(y - 1);
		a[y - 1].emplace_back(x - 1);
		f[x - 1]--;
		f[y - 1]--;
	}
	fill(c, c + n, -1);
	fill(s, s + n, 0);
	for (int i = 0; i < n; i++){
		if (c[i] == -1){
			dfs(i);
			col++;
		}
	}
	for (int i = 0; i < n; i++) f[i] += s[c[i]];
	for (int i = 0; i < k; i++){
		scanf("%d %d", &x, &y);
		x--, y--;
		if (c[x] == c[y]) f[x]--, f[y]--;
	}
	for (int i = 0; i < n; i++) printf("%d ", f[i]);
}