//#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<cmath>
#include<map>
#include<unordered_map>
#include<functional>
#include<queue>
#include<set>
#include<stack>
#include<iomanip>
#include<algorithm>
#include<numeric>
#include<memory>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(a)   a.begin(),a.end()
template<typename T =ll> using v = vector<T>;
template<typename T =ll> using vv = v<v<T>>;
template<typename T =ll,typename U =ll> using p = pair<T,U>;
template<typename T> T chmin(T &a,T b) {return a=min(a,b);}
template<typename T> T chmax(T &a,T b) {return a=max(a,b);}
const ll INF = (ll)1e9;
template <int MOD>
struct ModInt {
    using lint = long long;
    int val;

    // constructor
    ModInt(lint v = 0) : val(v % MOD) {
        if (val < 0) val += MOD;
    };

    // unary operator
    ModInt operator+() const { return ModInt(val); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt inv() const { return this->pow(MOD - 2); }

    // arithmetic
    ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }
    ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }
    ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }
    ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }
    ModInt pow(lint n) const {
        auto x = ModInt(1);
        auto b = *this;
        while (n > 0) {
            if (n & 1) x *= b;
            n >>= 1;
            b *= b;
        }
        return x;
    }

    // compound assignment
    ModInt& operator+=(const ModInt& x) {
        if ((val += x.val) >= MOD) val -= MOD;
        return *this;
    }
    ModInt& operator-=(const ModInt& x) {
        if ((val -= x.val) < 0) val += MOD;
        return *this;
    }
    ModInt& operator*=(const ModInt& x) {
        val = lint(val) * x.val % MOD;
        return *this;
    }
    ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }
    //
    ModInt operator++(int) {
        auto t = *this;
        *this += 1;
        return t;
    }

    ModInt operator--(int) {
        auto t = *this;
        *this -= 1;
        return t;
    }
    ModInt operator<<(const int n){
        return ModInt(*this)*ModInt(2).pow(n);
    }
    // compare
    bool operator==(const ModInt& b) const { return val == b.val; }
    bool operator!=(const ModInt& b) const { return val != b.val; }

    // I/O
    friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept { return is >> x.val; }
    friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }
};

constexpr int MOD = 1e9 + 7;
using mint = ModInt<MOD>;

v<shared_ptr<ll>> par((ll)1e5+1,nullptr);
ll hight[(ll)1e5+1];

void init(ll n){
    rep(i,n){
        par[i]=make_shared<ll>(i);
        hight[i]=0;
    }
}

shared_ptr<ll> find(ll x){
    if(*par[x]==x){
        return par[x];
    }else{
        return par[x]=find(*par[x]);
    }
}

void unite(ll x,ll y){
    auto par_x = find(x);
    auto par_y = find(y);
    if(par_x==par_y) return;

    if(hight[*par_x]<hight[*par_y]){
        par[*par_x]=par_y;
    }else{
        par[*par_y]=par_x;
        if(hight[*par_x]==hight[*par_y]) hight[*par_x]++;
    }
}


bool same(ll x,ll y){
    return find(x)==find(y);
}

ll member(ll i){
    return par[i].use_count();
}

void d(){ 
    ll N,M,K;
    cin >> N >> M >> K;

    auto ANS = v<>(N,0);
    init(N);

    rep(i,M){
        ll A,B;
        cin >> A >> B;
        A--;B--;
        unite(A,B);
        ANS[A]--;
        ANS[B]--;
    }

    rep(i,N) find(i).use_count();

    rep(i,N){
        ANS[i] += member(i)-1;
    }
    

    rep(i,K){
        ll C,D;
        cin >> C >> D;
        C--; D--;
        if(same(C,D)){
            ANS[C]--;
            ANS[D]--;
        }
    }
 
    cout << endl;
    rep(i,N){
        cout << ANS[i] << " ";
    }

}

int main(){
    d();
    return 0;
}

Measured memory_bytes: 7040