#include <bits/stdc++.h>

#define F first
#define S second

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

const int N = 100010, M = 2 * N;

int n, m, k;
int d[N];
int p[N], size[N];
int res[N];

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

int main()
{
	for (int i = 0; i < N; i ++ ) p[i] = i, size[i] = 1;
	
	scanf("%d%d%d", &n, &m, &k);
	
	for (int i = 0; i < m; i ++ )
	{
		int a, b;
		scanf("%d%d", &a, &b);
		d[a] ++ , d[b] ++ ;
		
		int aa = find(a), bb = find(b);
		if (aa == bb) continue;
		size[aa] += size[bb];
		p[bb] = aa;
	}
	
	for (int i = 1; i <= n; i ++ )
	{
		res[i] = size[find(i)];
		res[i] -= d[i];
		res[i] -- ;
	}
	
	for (int i = 0; i < k; i ++ )
	{
		int a, b;
		scanf("%d%d", &a, &b);
		
		int aa = find(a), bb = find(b);
		if (aa != bb) continue;
		res[a] -- , res[b] -- ;
	}
	
	for (int i = 1; i <= n; i ++ ) printf("%d ", res[i]);
	return 0;
}