#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> frie(100010, vector<int>(0));
vector<vector<int>> bloc(100010, vector<int>(0));
vector<bool> cand(100010);
vector<bool> seen(100010);
int n, m, k;
int dfs(int self) {
  if (seen[self] == 1) return 0;
  seen[self] = 1;
  cand[self] = 1;
  for (int i = 0; i < frie[self].size(); i++) dfs(frie[self][i]);
}
int main() {
  cin >> n >> m >> k;
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    frie[x].push_back(y);
    frie[y].push_back(x);
  }
  for (int i = 0; i < k; i++) {
    int x, y;
    cin >> x >> y;
    bloc[x].push_back(y);
    bloc[y].push_back(x);
  }
  for (int i = 1; i < n + 1; i++) {
    for (int j = 1; j < n + 1; j++) cand[j] = 0;
    for (int j = 1; j < n + 1; j++) seen[j] = 0;
    dfs(i);
    cand[i] = 0;
    for (int j = 0; j < frie[i].size(); j++) {
      cand[frie[i][j]] = 0;
    }
    for (int j = 0; j < bloc[i].size(); j++) {
      cand[bloc[i][j]] = 0;
    }
    int ans = 0;
    for (int j = 1; j < n + 1; j++) ans += cand[j];
    cout << ans << " ";
  }
  cout << endl;
}
