#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <vector>
#include <map>

using namespace std;

// template {{{
// misc {{{
using Z = int;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\e[0m" << endl;
    exit(1);
  }
  int size = container.size();
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
// }}}
// }}}

Z N, M, K;
vector<vector<Z>> graph;
vector<vector<Z>> block;
vector<Z> group;
map<Z, Z> group_size;

Z dfs(Z pos, Z id) {
  Z ans = 1;
  for (auto&& v : ix(graph, pos)) {
    if (ix(group, v) >= 0) continue;
    ix(group, v) = ix(group, pos);
    ans += dfs(v, id);
  }
  return ans;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> N >> M >> K;
  graph.resize(N);
  block.resize(N);
  group.resize(N, -1);
  for (auto i = 0; i < M; i++) {
    Z a, b;
    cin >> a >> b;
    a--; b--;
    ix(graph, a).push_back(b);
    ix(graph, b).push_back(a);
  }
  for (auto i = 0; i < K; i++) {
    Z a, b;
    cin >> a >> b;
    a--; b--;
    ix(block, a).push_back(b);
    ix(block, b).push_back(a);
  }
  dump(graph);
  dump(block);
  vector<Z> res(N);
  for (auto i = 0; i < N; i++) {
    dump(i);
    if (ix(group, i) == -1) {
      ix(group, i) = i;
      group_size[i] = dfs(i, i);
      dump(group_size[i]);
    }
    auto ans = group_size[ix(group, i)];
    dump(ans);
    for (auto&& p : ix(block, i))
      if (ix(group, p) == ix(group, i)) ans--;
    ix(res, i) = ans - ix(graph, i).size() - 1;
  }
  dump(group);
  cout << res << endl;
}



Measured memory_bytes: 13824