#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 = 20;

class DSU {
  private:
  vector<int> par;
  vector<int> wt;
  public:
  DSU(int n) : par(n), wt(n){
    for(int i = 0; i < n; i++) {
      par[i] = i , wt[i] = 1;
    }
  }
  int root(int n) {
    if(n == par[n]) return n;
    return root(par[n]);
  } 
  void unite(int a, int b) {
    int Ra = root(a), Rb = root(b);
    if(Ra == Rb) return;
    if(wt[Ra] < wt[Rb]){
      par[Ra] = par[Rb];
      wt[Rb] += wt[Ra];
    } else{
      par[Rb] = par[Ra];
      wt[Ra] += wt[Rb];
    }
  }
  int Rank(int n) {
    return wt[root(n)];
  }
  bool ispar(int n) {
    return par[n] == n;
  }
  bool same(int a, int b) {
    return root(a) == root(b);
  }
};
signed main(){
  ios::sync_with_stdio(false);cin.tie(0);

    int n , m , k;
    cin >> n >> m >> k;
    DSU d(n);
    vector<int> deg(n,0);
    for(int i = 0; i < m; i++ ) {
      int u , v;
      cin >> u >> v;
      u--,v--;
      d.unite(u, v);
      deg[u]++;
      deg[v]++;
    }
    vector<int> block(n, 0);
    for(int i = 0; i < k; i++) {
      int u , v;
      cin >> u >> v;
      u--,v--;
      if(d.root(u) == d.root(v)) {
        block[u]++;
        block[v]++;
      }
    }
  
    for(int i = 0; i < n; i++) {
      int com = d.Rank(i);
      int ans = com - 1 -  deg[i] - block[i];
      cout << ans <<" ";
    }
    cout << '\n';
  
}

Measured memory_bytes: 6360