#define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using tll = tuple<ll, ll, ll>;
using vtll = vector<tll>;
using vvtll = vector<vtll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define PI 3.1415926535897932384626433832795028841971693993751L
#define INF 1111111111111111111LL
#define print(...) print_1(__VA_ARGS__)
#define in(...) in_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#define dumpa(...) dumpa_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#define dumpa(...)
#endif
template <typename Head>
void dump_1(const char* str, Head&& h)
{
    cerr << str << ": " << h << '\n';
}
template <typename Head, typename... Tail>
void dump_1(const char* str, Head&& h, Tail&&... t)
{
    while (*str != ',') {
        cerr << *str++;
    }
    cerr << ": " << h << ' ';
    dump_1(str + 1, t...);
}
template <typename T>
void dumpa_1(const char* str, const T v[], const ll size)
{
    while (*str != ',') {
        cerr << *str++;
    }
    cerr << ": ";
    for1 (i, size) {
        if (i != 0) {
            cerr << ' ';
        }
        cerr << v[i];
    }
    cerr << '\n';
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& v)
{
    os << v.first << ' ' << v.second;
    return os;
}
template <typename T1, typename T2, typename T3>
ostream& operator<<(ostream& os, const tuple<T1, T2, T3>& v)
{
    os << get<0>(v) << ' ' << get<1>(v) << ' ' << get<2>(v);
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    for (auto it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) {
            os << ' ';
        }
        os << *it;
    }
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v)
{
    for (auto it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) {
            os << ' ';
        }
        os << *it;
    }
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v)
{
    for (auto it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) {
            os << ' ';
        }
        os << *it;
    }
    return os;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const map<T1, T2>& v)
{
    os << '{';
    for (auto it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) {
            os << ", ";
        }
        os << it->first << ':' << it->second;
    }
    os << '}';
    return os;
}
ll divup(ll nume, ll deno)
{
    assert(nume >= 0);
    assert(deno > 0);
    return (nume + deno - 1) / deno;
}
void Yes(void) { cout << "Yes\n"; }
void No(void) { cout << "No\n"; }
void YES(void) { cout << "YES\n"; }
void NO(void) { cout << "NO\n"; }
template <typename T>
bool chmax(T& a, const T& b)
{
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T>
bool chmin(T& a, const T& b)
{
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T>
void vin(vector<T>& v, ll len)
{
    for1 (i, len) {
        cin >> v[i];
    }
}
template <typename Head>
void in_1(Head& h)
{
    cin >> h;
}
template <typename Head, typename... Tail>
void in_1(Head& h, Tail&... t)
{
    cin >> h;
    in_1(t...);
}
template <typename Head>
void print_1(Head&& h)
{
    cout << h << '\n';
}
template <typename Head, typename... Tail>
void print_1(Head&& h, Tail&&... t)
{
    cout << h << ' ';
    print_1(t...);
}
//---------------------------------------------------------
struct UnionFind {
    //親の番号を格納する。親だった場合は-(その集合のサイズ)
    vll parent;
    vll mini;
    vll maxi;
    ll N;

    //作るときはParentの値を全て-1にする
    //こうすると全てバラバラになる
    UnionFind(ll n)
    {
        this->N = n;
        this->parent = vll(n, -1);
        this->mini = vll(n);
        this->maxi = vll(n);
        for1 (i, n) {
            this->mini[i] = i;
            this->maxi[i] = i;
        }
    }

    // Aがどのグループに属しているか調べる
    ll root(ll A)
    {
        if (this->parent[A] < 0) return A;
        return this->parent[A] = this->root(this->parent[A]);
    }

    //自分のいるグループの頂点数を調べる
    ll size(ll A)
    {
        return -this->parent[this->root(A)];  //親をとってきたい
    }

    // AとBをくっ付ける
    bool connect(ll A, ll B)
    {
        // AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
        A = this->root(A);
        B = this->root(B);
        if (A == B) {
            //すでにくっついてるからくっ付けない
            return false;
        }

        //大きい方(A)に小さいほう(B)をくっ付けたい
        //大小が逆だったらひっくり返しちゃう。
        if (this->size(A) < this->size(B)) {
            swap(A, B);
        }

        // Aのサイズを更新する
        this->parent[A] += this->parent[B];
        // Bの親をAに変更する
        this->parent[B] = A;
        chmax(this->maxi[A], this->maxi[B]);
        chmin(this->mini[A], this->mini[B]);

        return true;
    }
};
//---------------------------------------------------------
void solve()
{
    ll N, M, K;
    in(N, M, K);
    UnionFind uni(N);
    vector<pll> AB(M);
    vector<pll> CD(K);

    for1 (i, M) {
        ll a, b;
        in(a, b);
        --a;
        --b;
        uni.connect(a, b);
        AB[i] = make_pair(a, b);
    }
    for1 (i, K) {
        ll c, d;
        in(c, d);
        --c;
        --d;
        CD[i] = make_pair(c, d);
    }
    set<ll> root;
    vvll child(N);
    for1 (i, N) {
        ll r = uni.root(i);
        root.insert(r);
        child[r].push_back(i);
    }
    vll ans(N);
    for1 (i, N) {
        ll num = uni.size(i);
        ans[i] = num - 1;
    }
    // dump(ans);
    for1 (i, M) {
        ll a, b;
        tie(a, b) = AB[i];
        if (uni.root(a) == uni.root(b)) {
            ans[a]--;
            ans[b]--;
            // dump(a, b, ans);
        }
    }
    for1 (i, K) {
        ll c, d;
        tie(c, d) = CD[i];
        if (uni.root(c) == uni.root(d)) {
            ans[c]--;
            ans[d]--;
            // dump(c, d, ans);
        }
    }
    print(ans);
}
//---------------------------------------------------------
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(16);
    cerr << fixed << setprecision(16);
    solve();
}


Measured memory_bytes: 16896