#include <bits/stdc++.h>
using namespace std;

// #include <boost/algorithm/string/join.hpp>
// using boost::algorithm::join;
//
// #include "boost/multi_array.hpp"
// boost::multi_array<int, 3> dp;
// dp.resize(boost::extents[10][9][8]);
//
// #include <boost/multiprecision/cpp_dec_float.hpp>  // quite slowly
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision; // mp::log10
// using bigint = boost::multiprecision::cpp_int;
// using rational = mp::cpp_rational;  // double d = static_cast<double>(r);

typedef long long ll;
typedef unsigned long long ull;
//typedef long double ld;

typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<double,double> pdd;
typedef set<int> si;
typedef set<ll> sll;
typedef vector<int> vi;
typedef vector<pair<int, int > > vii;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vll> vvll;

//constexpr ll MOD = 1e9+7;
template<typename T>constexpr auto inf=numeric_limits<T>::max()/4;
constexpr int INF=inf<int>;
constexpr ll LINF=inf<ll>;

#define Sort(x) sort(begin(x),end(x))
#define Reverse(x) reverse(begin(x),end(x))
#define ABS(a,b) ((a)<(b)?(b)-(a):(a)-(b))
#define nbit(n) (1ull<<(n))
#define _ol3(_1,_2,_3,name,...)name
#define _rep(i,n)_repi(i,0,n)
#define _repi(i,a,b)for(int i=a,i##_l=(b);i<i##_l;++i)
#define REP(...) _ol3(__VA_ARGS__,_repi,_rep,)(__VA_ARGS__)
#define REPR(i,n) for(int i=n-1;i>=0;--i)
#define REPA(i,v) REP(i,(v).size())

// sort(begin(x), end(x), greater<ll>());
// lower_bound(a.begin(), a.end(), val): a[i] ≥ valである最左の位置
// upper_bound(a.begin(), a.end(), val): a[i] > valである最左の位置

// Returns minimum of a and b.
// If a is less b, a is set to b.
template<typename T>
T chmin(T& a, T b) {
  if (a > b) {
    a = b;
  }
  return a;
}

// Returns maximum of a and b.
// If a is less b, a is set to b.
template<typename T>
T chmax(T& a, T b) {
  if (a < b) {
    a = b;
  }
  return a;
}

template <typename T>
void dumpContents(const T& v, const string& msg)
{
  cerr << "### " << msg << " ###\n";
  for (const auto& x : v) {
    cerr << x << " ";
  }
  cerr << endl;
}

struct before_main_function {
  before_main_function() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<setprecision(20)<<fixed;
#define endl "\n"
  }
} before_main_function;

template <int NMAX>
class UnionFind {
private:
  int par[NMAX];  // 親
  int rank[NMAX]; // 木の深さ

public:
  ll N;      // number of nodes
  vll sizes; // node iが親であるgroupの要素数

  // n is the number of nodes
  void init(int n) {
    N = n;
    sizes.resize(N, 1);

    for (int i=0; i<n; i++) {
	par[i] = i;
	rank[i] = 0;
    }
  }

  void unite(int x, int y) {
      x = find(x);
      y = find(y);
      if (x==y) return;

      if (rank[x] < rank[y]) {
  	par[x] = y;
	sizes[y] = sizes[x] + sizes[y]; // xは放置
      } else {
  	par[y] = x;
  	if (rank[x] == rank[y]) rank[x]++;
	sizes[x] = sizes[x] + sizes[y]; // yは放置
      }
  }

  bool same(int x, int y) {
      return find(x) == find(y);
  }

  int find(int x) {
      if (par[x] == x) {
  	return x;
      } else {
  	return par[x] = find(par[x]);
      }
  }

};
// ========== end of template ==========
constexpr int N_MAX = 1e5+10;
UnionFind<N_MAX> uf;

int main(int argc, char** argv) {
  int N, M, K;
  cin >> N >> M >> K;

  uf.init(N);

  vector<si> AB(N);
  REP(i, M) {
    int a, b;
    cin >> a >> b;
    a--; b--;

    AB[a].insert(b);
    AB[b].insert(a);
    uf.unite(a, b);
  }

  vector<si> groups(N);
  REP(i, N) {
    int g = uf.find(i);
    groups[g].insert(i);
  }

  vector<si> CD(N);
  REP(i, K) {
    int c, d;
    cin >> c >> d;
    c--; d--;

    CD[c].insert(d);
    CD[d].insert(c);
  }

  REP(i, N) {
    const si& G = groups[uf.find(i)];
    int ret = G.size() - 1 - AB[i].size(); // self

    for (auto x : CD[i]) {
      if (G.count(x)) ret--;
    }

    cout << ret;
    if (i != N-1) cout << " ";
  }

  cout << endl;

  return 0;
}

/* vim: set expandtab shiftwidth=2 softtabstop=2 : */


Measured memory_bytes: 39936