#include <bits/stdc++.h>
 
//#include <unistd.h>
//#include <iostream>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
//#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'


class UnionFind {
public:
  int n;
  vi par; //�e
  vi ran; //�؂̐[��
  vi num; //�v�f��
  int g; // group��
 
  UnionFind(int _n) {
	n = _n;
	g = n;
	par.resize(n); ran.resize(n); num.resize(n);
	for (int i = 0; i < n; i++) {
	  par[i] = i; ran[i] = 0; num[i] = 1;
	}
  }
 
  //�؂̍������߂�
  int find(int x) {
	if (par[x] == x) {
	  return x;
	}
	else {
	  return par[x] = find(par[x]);
	}
  }
 
  //x��y�̑�����W���𕹍�
  void unite(int x, int y) {
	x = find(x); y = find(y);
	int numsum = num[x] + num[y];
	if (x == y) {
	  return;
	}
	if (ran[x]<ran[y]) {
	  par[x] = y;
	}
	else {
	  par[y] = x;
	  if (ran[x] == ran[y]) {
		ran[x]++;
	  }
	}
	num[x] = num[y] = numsum;
	g--;
  }
 
  //x��y�������W���ɑ����邩�ۂ�
  bool same(int x, int y) {
	return find(x) == find(y);
  }
 
};


signed main() {
	fio();
	int n, m, k;
	cin >> n >> m >> k;
	UnionFind uf(n);
	vi f(n);
	rep (i, m) {
		int u, v;
		cin >> u >> v;
		u--; v--;
		f[u]++; f[v]++;
		uf.unite(u, v);
	}

	vii b(n);
	rep (i, k) {
		int u, v;
		cin >> u >> v;
		u--; v--;
		b[u].push_back(v);
		b[v].push_back(u);
	}

	rep (i, n) {
		int ans = uf.num[uf.find(i)] - f[i] - 1;
		rep (j, b[i].size()) {
			int v = b[i][j];
			if (uf.same(i, v)) ans--;
		}
		cout << ans << " ";
	}
	cout << endl;
}

Measured memory_bytes: 7552