#include <bits/stdc++.h>
using namespace std;
long long int DFS(vector<vector<long long int>> X, long long int k,
                  long long int i, vector<long long int>& visit,
                  long long int count) {
  for (int j = 0; j < X.size(); j++) {
    if (visit[j] == 0 && X[k][j] == 1) {
      if (X[i][j] == 0) {
        count++;
      }
      visit[j] = 1;
      count = DFS(X, j, i, visit, count);
    }
  }
  return count;
}
int main() {
  long long int N, M, K;
  cin >> N >> M >> K;
  vector<vector<long long int>> X(N, vector<long long int>(N, 0));
  for (int i = 0; i < M; i++) {
    long long int A, B;
    cin >> A >> B;
    X[A - 1][B - 1] = 1;
    X[B - 1][A - 1] = 1;
  }
  for (int i = 0; i < K; i++) {
    long long int A, B;
    cin >> A >> B;
    X[A - 1][B - 1] = -1;
    X[B - 1][A - 1] = -1;
  }
  for (int i = 0; i < N; i++) {
    vector<long long int> visit(N, 0);
    visit[i] = 1;
    long long int count = 0;
    count = DFS(X, i, i, visit, count);
    cout << count << ' ';
  }
  return 0;
}
