#include <bits/stdc++.h>
using namespace std;

// clang-format off
#define  range(i, l, r) for (int i = (int)(l); i < (int)(r); ++(i))
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); --(i))

#define  whole(f, x, ...) ([&](decltype((x)) container) { return (f)(  begin(container),  end(container), ## __VA_ARGS__); })(x)
#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)

#define endl '\n'
#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl

using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;

// constexpr i32 mod   = 998244353;
constexpr i32 mod   = 1e9 + 7;
constexpr i32 inf   = 1001001001;
constexpr i64 infll = 1001001001001001001ll;

constexpr int dx[] = {0, -1, 1, 0, -1, 1, -1, 1}; 
constexpr int dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};

struct IoSetup { IoSetup(int x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;

template <typename T = i64> T input() { T x; cin >> x; return x; }

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } 
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }

template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }

template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// clang-format on

class union_find {

  using data_type = int_fast32_t;
  std::vector< data_type > data_;

public:
  union_find(std::size_t size) : data_(size, -1) {}

  std::size_t size() const {
    return data_.size();
  }

  // x を含む集合の representative を経路圧縮しながら返す
  data_type get_root(data_type x) {
    return (data_[x] < 0 ? x : data_[x] = get_root(data_[x]));
  }

  // x が集合の representative なら true を返す
  bool is_root(data_type x) {
    return x == get_root(x);
  }

  // x と y が同じ集合に含まれるなら ture を返す
  bool is_same(data_type x, data_type y) {
    return get_root(x) == get_root(y);
  }

  // x を含む集合と y を含む集合を併合
  void unite(data_type x, data_type y) {
    x = get_root(x); y = get_root(y);
    if (x == y) return;

    if (data_[x] > data_[y]) std::swap(x, y);
    data_[x] += data_[y];
    data_[y] = x;
  }

  // x を含む集合の要素数を返す
  data_type element_count(data_type x) {
    return -data_[get_root(x)];
  }
};

void solver() {
    int N = input(), M = input(), K = input();
    
    vector< int > ans(N);
    union_find uf(N);
    
    range(i, 0, M) {
        int a = input() - 1, b = input() - 1;
        uf.unite(a, b);
        
        ans[a]--;
        ans[b]--;
    }

    range(i, 0, K) {
        int c = input() - 1, d = input() - 1;
        if (uf.is_same(c, d)) {
            ans[c]--;
            ans[d]--;
        }
    }

    range(i, 0, N) {
        ans[i] += uf.element_count(i) - 1;
    }
    
    cout << ans << endl;
}

signed main(int argc, char *argv[]) {
    solver();
}


Measured memory_bytes: 2048