/**
 *    author  : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
 *    created : 2020-03-01 20:30:47
**/

#include <iostream>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <complex>
#include <numeric>
#include <bitset>
#include <cassert>
#include <cctype>
#include <iomanip>
#include <random>
#include <utility>
#include <chrono>

using namespace std;

using int64 = long long;

template<class T> using binary_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template<class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) { os << '{'; size_t n = vec.size(); for (size_t i = 0; i < n; ++i) { os << vec[i]; if (i != n - 1) os << ','; } os << '}'; return os; }
template<class T, class U> std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) { return os << '{' << p.first << " " << p.second << '}'; }
template<class T, class U> std::ostream& operator<<(std::ostream& os, const std::map<T, U>& mp) { os << '{'; for (auto it = mp.begin(); it != mp.end(); ++it) { os << '{' << it->first << ':' << it->second << '}'; if (it != --mp.end()) os << ','; } os << '}'; return os; }
template<class T> std::ostream& operator<<(std::ostream& os, const std::set<T>& st) { os << '{'; for (auto it = st.begin(); it != st.end(); ++it) { os << *it; if (it != --st.end()) os << ','; } os << '}'; return os; }
template<class T> std::istream& operator>>(std::istream& is, std::vector<T>& vec) { size_t n = vec.size(); for (size_t i = 0; i < n; ++i) is >> vec[i]; return is; }

#define all(_) begin(_), end(_)
#define rall(_) rbegin(_), rend(_)

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)
#else
#define debug(...) 1728
#endif

void debug_out() { std::cerr << '\n'; }

template <class Head, class... Tail>
void debug_out(Head&& head, Tail&&... tail) {
  std::cerr << head;
  if (sizeof...(Tail) != 0) std::cerr << ", ";
  debug_out(std::forward<Tail>(tail)...);
}

class UnionFind {
 public:
  UnionFind(int n) : n_(n) { Initialize(); }

  int GetRoot(int x) {
    if (parent_[x] < 0)
      return x;
    else
      return parent_[x] = GetRoot(parent_[x]);
  }

  bool IsSame(int x, int y) { return GetRoot(x) == GetRoot(y); }

  void Unite(int x, int y) {
    x = GetRoot(x);
    y = GetRoot(y);
    if (x == y) return;
    if (parent_[x] > parent_[y]) std::swap(x, y);
    parent_[x] += parent_[y];
    parent_[y] = x;
    return;
  }

  int GetSize(int x) { return -parent_[GetRoot(x)]; }

 private:
  const int n_;
  std::vector<int> parent_;

  void Initialize() { parent_.assign(n_, -1); }
};


int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  int n, m, k; cin >> n >> m >> k;

  vector<int> a(m), b(m);
  for (int i = 0; i < m; ++i) {
    cin >> a[i] >> b[i]; --a[i]; --b[i];
  }

  vector<int> c(k), d(k);
  for (int i = 0; i < k; ++i) {
    cin >> c[i] >> d[i]; --c[i]; --d[i];
  }

  map<pair<int, int>, int> block;
  for (int i = 0; i < k; ++i) {
    ++block[{c[i], d[i]}];
    ++block[{d[i], c[i]}];
  }

  UnionFind uf(n);

  for (int i = 0; i < m; ++i) {
    uf.Unite(a[i], b[i]);
  }

  map<int, int> already_friend;

  for (int i = 0; i < m; ++i) {
    ++already_friend[a[i]];
    ++already_friend[b[i]];
  }

  map<int, int> already_block;

  for (int i = 0; i < k; ++i) {
    if (uf.IsSame(c[i], d[i]) && (block.find({c[i], d[i]}) != block.end())) {
      ++already_block[c[i]];
      ++already_block[d[i]];
    }
  }

  for (int i = 0; i < n; ++i) {
    cout << uf.GetSize(i) - 1 - already_friend[i] - already_block[i] << " ";
  }
  cout << '\n';

  return 0;
}

Measured memory_bytes: 24704