#include<iostream>
#include<cstdio>
#include<stack>
#include<queue>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<math.h>
#include<tuple>
#include<string.h>
#include <numeric> 
#include<unordered_map>
using namespace std; 
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define pp(...) "\033[94m [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "]\033[0m"
#define pp1(...) "\033[1;47;35m" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "]\033[0m"
#define dg(x) debug() << pp1(x)
#define dg1(x) debug() << pp(x)
#define dg2(x,y) debug() << pp(x) pp(y)
#define dg3(x,y,z) debug() << pp(x) pp(y) pp(z)
#define dg4(w,x,y,z) debug() << pp(w) pp(x) pp(y) pp(z)
#define int long long
#define all(x) x.begin() , x.end()
#define clr(x) memset(x , 0 , sizeof x);
#define sz(x) (int)x.size()
template<typename T> void db(T x ){ debug() <<">>> " <<  x; }
template<typename T> void db(T x , T y){ debug() <<">>> " <<  x <<" , "<< y; }
template<typename T> void db(T x , T y , T z){ debug() <<">>> "<< x <<" , "<< y <<" , "<< z; }
template<typename T> void db(T x , T y , T z , T a){ debug() <<">>> "<< x <<" , " << y <<" , "<< z <<" , "<< a; }
const int xx = 2e5;
const int Mod = 1e9 + 7;
const int inf = 1e18;
const int Maxn = 20010;


int arr[xx + 10], wt[xx + 10];

void init(int n){
    for(int i=1;i <= n;i++){
        arr[i]  = i;
        wt[i]  = 1;
    }
}

int root(int i){
    while(arr[i] != i){
        arr[i]  = arr[arr[i]];
        i = arr[i];
    }
    return i;
}

void unite(int A , int B){
    int root_A = root(A);
    int root_B = root(B);

    if(root_A == root_B)
        return;

    if(wt[root_A] < wt[root_B]){
        arr[root_A] = arr[root_B];
        wt[root_B] = wt[root_B] + wt[root_A];
    }
    else{
        arr[root_B] = arr[root_A];
        wt[root_A] = wt[root_A] + wt[root_B];
    }
}
              

signed main(){
  ios::sync_with_stdio(false);cin.tie(0);

  int n , m , k;
  cin >> n >> m >> k;
  init(n);
  vector<int> deg(n+1,0);
  for(int i = 0; i < m; i++ ) {
    int u , v;
    cin >> u >> v;
    unite(u, v);
    deg[u]++;
    deg[v]++;
  }
  vector<int> block(n+1, 0);
  for(int i = 0; i < k; i++) {
    int u , v;
    cin >> u >> v;
    if(root(u) == root(v)) {
      block[u]++;
      block[v]++;
    }
  }

  for(int i = 1; i <= n; i++) {
    int com = wt[root(i)];
    dg2(i , root(i));
    dg4(i , com , deg[i] , block[i]);
    int ans = com - 1 -  deg[i] - block[i];
    cout << ans <<" ";
  }
  cout << '\n';
}

Measured memory_bytes: 6340