//#define _GLIBCXX_DEBUG
//#include <atcoder/all>
#include <bits/stdc++.h>

#ifndef ATCODER_DSU_HPP
#define ATCODER_DSU_HPP 1

#include <algorithm>
#include <cassert>
#include <vector>

namespace atcoder {

// Implement (union by size) + (path compression)
// Reference:
// Zvi Galil and Giuseppe F. Italiano,
// Data structures and algorithms for disjoint set union problems
struct dsu {
  public:
    dsu() : _n(0) {}
    dsu(int n) : _n(n), parent_or_size(n, -1) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        return x;
    }

    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }

  private:
    int _n;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
};

}  // namespace atcoder

#endif  // ATCODER_DSU_HPP

using namespace std;
using namespace atcoder;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
//const ll MOD=998244353;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
int dx[9] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
int dy[9] = {0, 1, 0, -1, 1, -1, -1, 1, 0};

template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }



int main()
{
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  // cout << fixed << setprecision(15);

  ll N,M,K; cin>>N>>M>>K;
  vector<pair<ll,ll>> edges(M);
  rep(i,M){
    ll a,b; cin>>a>>b; a--; b--;
    edges[i]={a,b};
  }
  vector<pair<ll,ll>> block_edges(K);
  rep(i,K){
    ll c,d; cin>>c>>d; c--; d--;
    block_edges[i]={c,d};
  }
  
  //友達の数の配列
  vector<ll> friends(N,0);
  rep(i,M){
    ll a,b; tie(a,b)=edges[i];
    friends[a]++;
    friends[b]++;
  }
  
  //union_find
  dsu uf(N);
  for(auto e:edges){
    ll a,b; tie(a,b)=e;
    uf.merge(a,b);
  }
  
  //ブロック関係の数
  vector<ll> blocks(N,0);
  for(auto e:block_edges){
    ll c,d; tie(c,d)=e;
    if(uf.same(c,d)){
      blocks[c]++;
      blocks[d]++;
    }
  }
  
  rep(i,N){
    if(i!=0) cout<<" ";
    cout<<uf.size(i)-1-friends[i]-blocks[i];
  }
  cout<<'\n';
  
  return 0;
}


Measured memory_bytes: 8116