#include <bits/stdc++.h>
using namespace std;
const int e = 100005;
const long long INF = 1e18 + 5;
vector<int> f[e];
vector<int> b[e];
vector<int> v(e, 0);
unordered_set<int> s;
void dfs(int u) {
  v[u] = 1;
  s.insert(u);
  for (int c : f[u]) {
    if (!v[c]) {
      dfs(c);
    }
  }
}
void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    f[x].push_back(y);
    f[y].push_back(x);
  }
  for (int i = 0; i < k; i++) {
    int x, y;
    cin >> x >> y;
    b[x].push_back(y);
    b[y].push_back(x);
  }
  vector<int> ans(e, 0);
  for (int i = 1; i <= n; i++) {
    s.clear();
    if (v[i]) continue;
    dfs(i);
    int p = s.size();
    for (int u : s) {
      ans[u] = p - 1 - f[u].size();
      for (int bck : b[u]) {
        if (s.count(bck)) ans[u]--;
      }
    }
  }
  for (int i = 1; i < n + 1; i++) cout << ans[i] << " ";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  solve();
  return 0;
}
