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

struct UnionFind {
  vector<int> d;
  UnionFind(int n = 0) : d(n, -1) {}
  int find(int x) {
    if (d[x] < 0) return x;
    return d[x] = find(d[x]);
  }
  bool unite(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return false;
    if (d[x] > d[y]) swap(x, y);
    d[x] += d[y];
    d[y] = x;
    return true;
  }
  bool same(int x, int y) { return find(x) == find(y); }
  int size(int x) { return -d[find(x)]; }
};
int main(void) {
  int N, M, K;
  cin >> N >> M >> K;
  UnionFind fr(N);
  map<int, int> mfr, mbl;
  for (int i = 0; i < M; i++) {
    int A, B;
    cin >> A >> B;
    A--;
    B--;
    mfr[A]++;
    mfr[B]++;
    fr.unite(A, B);
  }
  for (int i = 0; i < K; i++) {
    int C, D;
    cin >> C >> D;
    C--;
    D--;
    if (fr.find(C) == fr.find(D)) {
      mbl[C]++;
      mbl[D]++;
    }
  }
  for (int i = 0; i < N; i++) {
    cout << max(0, fr.size(i) - mfr[i] - mbl[i] - 1) << " ";
  }
  return 0;
}