#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int pa[N], cnt[N], fr[N];
int n, m, k;
int search(int x) { return pa[x] == x ? pa[x] : pa[x] = search(pa[x]); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  while (cin >> n >> m >> k) {
    for (int i = 1; i <= n; i++) {
      pa[i] = i;
      cnt[i] = 1;
      fr[i] = 0;
    }
    int x, y;
    while (m--) {
      cin >> x >> y;
      int a = search(x);
      int b = search(y);
      if (a != b) {
        pa[a] = b;
        cnt[b] += cnt[a];
      }
      fr[x]++;
      fr[y]++;
    }
    for (int i = 1; i <= n; i++) {
      cnt[i] = cnt[search(i)];
    }
    while (k--) {
      cin >> x >> y;
      int a = search(x);
      int b = search(y);
      if (a == b) {
        cnt[x]--, cnt[y]--;
      }
    }
    for (int i = 1; i <= n; i++) cout << cnt[i] - fr[i] - 1 << ' ';
    cout << endl;
  }
  return 0;
}
