#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i, s, n) for(int i = (s), i##_len=(n); i < i##_len; ++i)
#define FORS(i, s, n) for(int i = (s), i##_len=(n); i <= i##_len; ++i)
#define VFOR(i, s, n) for(int i = (s); i < (n); ++i)
#define VFORS(i, s, n) for(int i = (s); i <= (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FORS(i, 0, n)
#define VREP(i, n) VFOR(i, 0, n)
#define VREPS(i, n) VFORS(i, 0, n)
#define RFOR(i, s, n) for(int i = (s), i##_len=(n); i >= i##_len; --i)
#define RFORS(i, s, n) for(int i = (s), i##_len=(n); i > i##_len; --i)
#define RREP(i, n) RFOR(i, n, 0)
#define RREPS(i, n) RFORS(i, n, 0)
#define ALL(v) (v).begin(), (v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(ALL(v), greater<decltype(v[0])>())
#define SZ(x) ((int)(x).size())
#define REV(x) reverse(ALL(x))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end())

using ld = long double;
using ll = long long;
using ui = unsigned int;
using ull = unsigned long long;
using Pi_i = pair<int, int>;
using Pll_ll = pair<ll, ll>;
using VB = vector<bool>;
using VC = vector<char>;
using VD = vector<double>;
using VI = vector<int>;
using VLL = vector<ll>;
using VS = vector<string>;
using VSH = vector<short>;
using VULL = vector<ull>;

const int MOD = 1000000007;
const int INF = 1000000000;
const int NIL = -1;
const double EPS = 1E-10;

template<class T, class S>
bool chmax(T &a, const S &b){
    if(a < b){
        a = b; return true;
    }
    return false;
}
template<class T, class S>
bool chmin(T &a, const S &b){
    if(b < a){
        a = b; return true;
    }
    return false;
}

class UnionFind{
    vector<int> par;
    vector<int> rank;
    vector<int> kosuu;

public:
    UnionFind(){}
    UnionFind(int n): par(n), rank(n), kosuu(n){
        REP(i, n){
            par[i] = i;
            rank[i] = 0;
            kosuu[i] = 1;
        }
    }

    void resize(int n){
        int m = par.size();
        par.resize(n);
        rank.resize(n, 0);
        kosuu.resize(n, 1);
        FOR(i, m, n) par[i] = i;
    }

    int find(int x){
        if(x == par[x]) return x;
        else return par[x] = find(par[x]);
    }

    void unit(int x, int y){
        x = find(x);
        y = find(y);
        if(x == y) return;

        if(rank[x] < rank[y]){
            par[x] = y;
            kosuu[y] += kosuu[x];
        }else{
            par[y] = x;
            if(rank[x] == rank[y]) ++rank[x];
            kosuu[x] += kosuu[y];
        }
    }

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

    int nanko(int x){
        return kosuu[find(x)];
    }
};


int main(){
    int N, M, K; cin >> N >> M >> K;
    UnionFind uff(N);
    vector<VI> frnd(N), blck(N);
    REP(i, M){
        int A, B; cin >> A >> B;
        --A; --B;
        frnd[A].EB(B);
        frnd[B].EB(A);
        uff.unit(A, B);
    }
    REP(i, K){
        int C, D; cin >> C >> D;
        --C; --D;
        blck[C].EB(D);
        blck[D].EB(C);
    }
    REP(i, N){
        if(i) cout << " ";
        int ans = uff.nanko(i);
        REP(j, frnd[i].size()){
            if(uff.same(i, frnd[i][j]))
                --ans;
        }
        REP(j, blck[i].size()){
            if(uff.same(i, blck[i][j]))
                --ans;
        }
        --ans;
        cout << ans;
    }
    cout << endl;
    return 0;
}


Measured memory_bytes: 13048