/*  /$$                                     /$$
      | $$                                    | $$
  /$$$$$$$  /$$$$$$   /$$$$$$$  /$$$$$$   /$$$$$$$  /$$$$$$   /$$$$$$
 /$$__  $$ /$$__  $$ /$$_____/ /$$__  $$ /$$__  $$ /$$__  $$ /$$__  $$
| $$  | $$| $$$$$$$$| $$      | $$  \ $$| $$  | $$| $$$$$$$$| $$  \__/
| $$  | $$| $$_____/| $$      | $$  | $$| $$  | $$| $$_____/| $$
|  $$$$$$$|  $$$$$$$|  $$$$$$$|  $$$$$$/|  $$$$$$$|  $$$$$$$| $$
 \_______/ \_______/ \_______/ \______/  \_______/ \_______/|__//$$$$$$ /$$$$$$
                                                               |______/|______/

*/
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <queue>
#include <unordered_map>
#define fastio        ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ln            cout << endl;
#define vi            vector<int>
#define vll           vector<long long>
#define sortl(vec)    sort(vec.begin(), vec.end());
#define sortr(vec)    sort(vec.rbegin(), vec.rend());
#define forn(i, x, n) for(long long i = x; i < n; i++)
#define revn(i, n, x) for(long long i = n; i >= x; i--)
#define in(vec)       for(auto &it : vec) cin >> it;
#define loop(vec)     for(auto &it : vec)
#define	out(vec)      for(auto &it : vec) cout << it << " "; ln
#define ll            long long
#define mod           1000000007
#define pb            emplace_back
#define mp            make_pair
#define um            unordered_map
#define pii           pair<int, int>
#define pll           pair<ll, ll>
#define f             first
#define s             second
#define pi            3.14159265359
#define o(x)		  cout << x << endl;
#define CLOCK         cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" secs"<<endl;
using namespace std;

ll bS(ll l, ll r, ll x, vll arr) {
	while (l <= r) {
		ll m = l + (r - l) / 2;

		if (arr[m] == x)
			return m;

		if (arr[m] < x)
			l = m + 1;

		else
			r = m - 1;
	}

	return -1;
}

void primeFactors(ll n) {
	while (n % 2 == 0) {
		//cout << 2 << " ";
		n = n / 2;
	}

	for (ll i = 3; i <= sqrt(n); i += 2) {
		while (n % i == 0) {
			//cout << i << " ";
			n = n / i;
		}
	}

	if (n > 2)
		cout << n << " ";
}

ll power(ll x, ll y, ll p) {
	ll res = 1;
	x = x % p;

	while (y > 0) {
		if (y & 1)
			res = (res * x) % p;

		y = y >> 1;
		x = (x * x) % p;
	}
	return res;
}

ll modulo(ll a, ll b) {
	ll c = a % b;
	return (c < 0) ? c + b : c;
}
vll vis(100005, 0);
vll adj[100005];

void dfs(ll node, ll key) {
	if (!vis[node]) {
		vis[node] = key;
		//cout << "hola " << node << endl;
		for (auto i : adj[node]) {
			//	cout << i << endl;
			dfs(i, key);

		}

	}

}

int main() {
// in(vec) works for size-defined type vectors

#ifndef ONLINE_JUDGE
	// for getting input from input.txt
	freopen("input1.txt", "r", stdin);
	// for writing output to output.txt
	freopen("output1.txt", "w", stdout);
#endif

	fastio
	ll t = 1;
	while (t--) {
		ll n, m, k, a, b;
		cin >> n >> m >> k;
		vll C(100005), D(100005), siz(100005, 0);
		map<ll, ll>hash;

		/*forn(i, 1, n + 1) {
			forn(j, 0, adj[i].size()) {
				cout << adj[i][j] << " ";
			}
			o("")
		}*/

		forn(i, 0, m) {
			cin >> a >> b;
			adj[a].push_back(b);
			adj[b].push_back(a);

		}

		forn(i, 0, k) {
			cin >> a >> b;
			C[i] = a;
			D[i] = b;
		}

		ll key = 0;
		forn(i, 1, n + 1) {
			if (!vis[i]) {
				//cout << "hola " << i << endl;
				++key;
				dfs(i, key);
			}

		}
		//
		//forn(i, 1, n + 1)
		//cout << vis[i] << " ";
		forn(i, 1, n + 1) {
			hash[vis[i]]++;
		}

		forn(i, 1, n + 1) {
			siz[i] = hash[vis[i]] - 1 - adj[i].size();

		}
		forn(i, 0, k) {
			if (vis[C[i]] == vis[D[i]]) {
				siz[C[i]]--;
				siz[D[i]]--;
			}

		}
		forn(i, 1, n + 1)
		cout << siz[i] << " ";


	}
	CLOCK
	return 0;
}



Measured memory_bytes: 17404