#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;

// chmax, chmin
template <class T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return 1;
  }
  return 0;
}

template <typename T>
function<T(T, T)> op_max = [](T a, T b) -> T { return max(a, b); };
template <typename T>
function<T(T, T)> op_min = [](T a, T b) -> T { return min(a, b); };

template <typename T>
function<T(T, T)> op_sum = [](T a, T b) -> T { return a + b; };

namespace detail
{
  template <typename T, std::size_t NDIMS>
  struct vector_builder
  {
    using type = std::vector<typename vector_builder<T, NDIMS - 1>::type>;

    static type make(std::vector<std::size_t> dims, const T &v = {})
    {
      const auto vec = std::vector<T>(dims.empty() ? 0 : dims.back(), v);
      if (!dims.empty())
        dims.pop_back();
      return vector_builder<std::vector<T>, NDIMS - 1>::make(dims, vec);
    }
  };

  template <typename T>
  struct vector_builder<T, 1>
  {
    using type = std::vector<T>;

    static type make(std::vector<std::size_t> dims, const T &v = {})
    {
      return type(dims.empty() ? 0 : dims.back(), v);
    }
  };
} // namespace detail

template <typename T, typename... SIZE_T>
auto exvector(const T &v, SIZE_T... dims)
{
  static_assert(sizeof...(dims) != 0, "invalid dimension");
  std::vector<std::size_t> vec_dims{dims...};
  return detail::vector_builder<T, sizeof...(dims)>::make(vec_dims, v);
}

using namespace std;
//********************  dumps ************************//

template <typename T>
void dump(const T &data, vector<int> &iter)
{
  cout << data << " ";
}
template <typename T>
void dump(const vector<T> &data, vector<int> &iter)
{
  for (auto elem : data)
    dump(elem, iter);
  cout << endl;
}

template <typename T>
void dump(const vector<vector<T>> &data, vector<int> &iter)
{
  for (auto elem : iter)
  {
    cout << "[" << elem << "]";
  }
  cout << endl;
  for (int i = 0; i < data.size(); i++)
  {
    iter.push_back(i);
    dump(data[i], iter);
    iter.pop_back();
  }
  cout << endl;
}

template <typename T>
void dump(const vector<T> &data, int dummy)
{
  for (int i = 0; i < data.size(); i++)
  {
    cout << "[" << i << "] " << data[i] << endl;
  }
}
template <typename T>
void dump(const T &data)
{ // T : data, U = base type val.
  vector<int> iter;
  dump(data, iter);
}
///////////////////////////////////////////////

class UnionFind
{
public:
  vector<int> parent;
  vector<LL> cnt;
  UnionFind(int n)
  {
    parent = vector<int>(n);
    cnt = vector<LL>(n, 1);
    for (int i = 0; i < n; i++)
      parent[i] = i;
  }
  int find(int v)
  {
    if (v == parent[v])
      return v;
    return parent[v] = find(parent[v]);
  }

  int uni(int u, int v)
  {
    u = find(u);
    v = find(v);
    if (u == v)
      return false;
    parent[u] = v;
    cnt[v] += cnt[u];
    return true;
  }
};

void solve(long long N, long long M, long long K, std::vector<long long> A, std::vector<long long> B, std::vector<long long> C, std::vector<long long> D)
{
  UnionFind uf(N);

  vector<int> cnt(N, 0);
  for (int i = 0; i < M; i++)
  {
    uf.uni(A[i], B[i]);
    cnt[A[i]]++;
    cnt[B[i]]++;
  }
  for (int i = 0; i < K; i++)
  {
    if (uf.find(C[i]) == uf.find(D[i]))
    {
      cnt[C[i]]++;
      cnt[D[i]]++;
    }
  }

  for (int i = 0; i < N; i++)
  {
    int base = uf.cnt[uf.find(i)] - 1;
    cout << base - cnt[i];
    if (i == N - 1)
      cout << endl;
    else
      cout << " ";
  }
}

int main()
{
  cout << setprecision(10);
  long long N;
  scanf("%lld", &N);
  long long M;
  scanf("%lld", &M);
  long long K;
  scanf("%lld", &K);
  std::vector<long long> A(M);
  std::vector<long long> B(M);
  for (int i = 0; i < M; i++)
  {
    scanf("%lld", &A[i]);
    scanf("%lld", &B[i]);
    A[i]--;
    B[i]--;
  }
  std::vector<long long> C(K);
  std::vector<long long> D(K);
  for (int i = 0; i < K; i++)
  {
    scanf("%lld", &C[i]);
    scanf("%lld", &D[i]);
    C[i]--;
    D[i]--;
  }
  solve(N, M, K, std::move(A), std::move(B), std::move(C), std::move(D));
  return 0;
}


Measured memory_bytes: 5888