// #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <cmath>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <stack>
#include <numeric>
// #include <windows.h>
using namespace std;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T1, class T2> using P = pair<T1, T2>;
using I = int;
using D = double;
using B = bool;
using C = char;
using S = string;
using LL = long long;
using LD = long double;
using ULL = unsigned long long;
using PII = P<I, I>;
using VPII = V<PII>;
using PLL = P<LL, LL>;
using VPLL = V<PLL>;
using VI = V<I>;
using VVI = VV<I>;
using VLL = V<LL>;
using VVLL = VV<LL>;
using VC = V<C>;
using VVC = VV<C>;
using VS = V<S>;
using VVS = VV<S>;
using VB = V<B>;
using VVB = VV<B>;
#define REP(type, i, n) for (type i = 0; i < (type)(n); ++i)
#define REP2(type, i, m, n) for (type i = (m); i < (type)(n); ++i)
#define REPR(type, i, n) for (type i = (n)-1; i >= 0; --i)
#define REPR2(type, i, m, n) for (type i = (n)-1; i >= (m); --i)
#define REPx(x, a) for(auto x : a)
#define ALL(a) a.begin(), a.end()
#define SORT(a) sort(ALL(a))
#define SORTR(a, type) sort(ALL(a), greater<type>())
#define SORTF(a, comp) sort(ALL(a), comp)
#define REVERSE(a) reverse(ALL(a))
#define SIZE(a, type) ((type)(a).size())
#define bit_search(bit, n) REP(LL, bit, 1LL<<(n))
#define bit_check(bit, i) ((bit>>(i)) & 1)
#define setpre(n) fixed << setprecision((n))
#define UNIQUE(a) do {SORT(a); (a).erase(unique(ALL(a)), (a).end());} while(0)
#define MAX(a) *max_element(ALL(a))
#define MIN(a) *min_element(ALL(a))
#define bisect_left(a, x) lower_bound(ALL(a), (x)) - a.begin()
#define bisect_right(a, x) upper_bound(ALL(a), (x)) - a.begin()
#define INPUT(a) REPx(&x, a) cin >> x;
#define INPUT2(a) REPx(&x, a) INPUT(x);
#define INPUTP(a) REPx(&x, a) cin >> x.first >> x.second;
#define ENDL cout << endl;

const int INF = 2e9;
// const LL INF = 9e18;
const LL MOD = 1e9+7;

template<class T> using PRIORITY_QUEUE = priority_queue< T, V<T>, greater<T> >;
template<class T> inline bool chmin(T &a, T b){if (a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T &a, T b){if (a < b) {a = b; return true;} return false;}
template<class T> inline void debug1(V<T> A){REP(int, i, SIZE(A, int)){if (A[i] == INF) cout << "I ";else cout << A[i] << " ";}ENDL}
template<class T> inline void debug2(VV<T> A){REP(int, i, SIZE(A, int)){REP(int, j, SIZE(A[i], int)){if (A[i][j] == INF) cout << "I "; else cout << A[i][j] << " ";}ENDL}}

template<class T>
struct UnionFind
{
  V<T> parent;
  UnionFind(const T& n): parent(n, -1){}

  // xの親を検索
  T find(const T& x)
  {
    if (parent[x] < 0) return x;
    return parent[x] = find(parent[x]);
  }

  // 同じ集合に属するかどうかをチェック
  bool same_check(const T& x, const T& y)
  {
    return find(x) == find(y);
  }

  // 自分の属する集合のサイズを返す
  T size(const T& x)
  {
    T y = find(x);
    return -parent[y];
  }

  // xとyの属する集合を併合
  bool unite(const T& x, const T& y)
  {
    T x_root = find(x), y_root = find(y);
    if (x_root == y_root) return false;
    else
    {
      if (-parent[x_root] < -parent[y_root]) swap(x_root, y_root);
      parent[x_root] += parent[y_root];
      parent[y_root] = x_root;
      return true;
    }
  }
};

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, m, k;
  cin >> n >> m >> k;
  VVI Friend(n, VI()), Block(n, VI());
  UnionFind<int> G(n);
  REP(int, i, m)
  {
    int a, b;
    cin >> a >> b;
    --a; --b;
    Friend[a].emplace_back(b);
    Friend[b].emplace_back(a);
    G.unite(a, b);
  }
  REP(int, i, k)
  {
    int c, d;
    cin >> c >> d;
    --c; --d;
    Block[c].emplace_back(d);
    Block[d].emplace_back(c);
  }
  REP(int, i, n)
  {
    int f = G.size(i);
    --f;
    if (!Friend[i].empty()) REPx(x, Friend[i]) if (G.same_check(i, x)) --f;
    if (!Block[i].empty()) REPx(x, Block[i]) if (G.same_check(i, x)) --f;
    cout << max(0, f) << " ";
  }
  ENDL

  return 0;
}


Measured memory_bytes: 14600