#include <iostream>
#include <iomanip>
#include <fstream>
#include <string>
#include <array>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <bitset>
#include <tuple>
#include <cmath>
#include <complex>
#include <algorithm>
#include <utility>
#include <regex>
#include <cstdint>
#include <numeric>
#include <functional>
#include <cassert>

using namespace std;
using ll  = long long;
using ull = unsigned long long;

namespace utils{
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
    template<class T, class Compare> using p_queue = priority_queue<T, vector<T>, Compare>;
    template<class T> using min_queue = p_queue<T, greater<T>>;
    template<class T> using max_queue = p_queue<T, less<T>>;

    template<class T> inline bool UPMIN(T& X, const T& A){ if(X > A) {X = A; return true;} return false; }
    template<class T> inline bool UPMAX(T& X, const T& A){ if(X < A) {X = A; return true;} return false; }

    template<class T>
    vector<T> VEC(int n, T t){
        return vector<T>(n, t);
    }
    template<class ...Ts>
    auto VEC(int n, Ts ... ts){
        return vector<decltype(VEC(ts...))>(n, VEC(ts...));
    }

    template <class S, class T>
    istream& operator>>(istream& is, tuple<S, T>& t){
        return is >> get<0>(t) >> get<1>(t);
    }

    template <class S, class T, class U>
    istream& operator>>(istream& is, tuple<S, T, U>& t){
        return is >> get<0>(t) >> get<1>(t) >> get<2>(t);
    }

    template <class S, class T>
    ostream& operator<<(ostream& os, const tuple<S, T>& t){
        return os << get<0>(t) << ' ' <<  get<1>(t);
    }

    template <class S, class T, class U>
    ostream& operator<<(ostream& os, const tuple<S, T, U>& t){
        return os << get<0>(t) << ' ' <<  get<1>(t) << ' ' <<  get<2>(t);
    }

    template<class T>
    istream& operator>>(istream& is, vector<T>& v){
        for (auto &&x : v) { is >> x; } return is;
    }

    template<class T>
    ostream& operator<<(ostream& os, const vector<T>& v){
        auto p = v.begin();
        assert(p != v.end());
        os << *p++;
        while(p != v.end()){
            os << ' ' << *p++;
        }
        return os ;
    }

    template<class T>
    ostream& operator<<(ostream& os, const vector<vector<T>>& v){
        auto p = v.begin();
        assert(p != v.end());
        os << *p++;
        while(p != v.end()){
            os << '\n' << *p++;
        }
        return os;
    }

    template<class ...Ts>
    ostream& operator<<(ostream& os, const vector<tuple<Ts...>>& v){
        auto p = v.begin();
        assert(p != v.end());
        os << *p++;
        while(p != v.end()){
            os << '\n' << *p++;
        }
        return os;
    }

    constexpr long long INFLL   = 1'000'000'000'000'000'000ll;
    constexpr int       INF     = 1'000'000'000;
    constexpr double    PI      = 3.14'159'265'358'973;
    constexpr double    EPS     = 1e-10;
}
using namespace utils;

class UFF {
    using Int = int;
    std::vector<Int> parent;
    std::vector<Int> rank;

public:
    explicit UFF(Int n) : parent(n, -1), rank(n, 0) {}

    Int find(Int x) {
        auto &px = parent[x];
        if (px < 0) {
            return x;
        } else {
            return px = find(px);
        }
    }

    bool unite(Int a, Int b) {
        const auto pa = find(a);
        const auto pb = find(b);
        if (pa == pb) return false;

        if (rank[pa] > rank[pb]) {
            parent[pa] += parent[pb];
            parent[pb] = pa;
        } else {
            parent[pb] += parent[pa];
            parent[pa] = pb;

            if (rank[pa] == rank[pb]) {
                rank[pb]++;
            }
        }
        return true;
    };

    Int size(Int x) {
        const auto px = find(x);
        return -parent[px];
    }

    bool is_same(Int a, Int b) {
        const auto pa = find(a);
        const auto pb = find(b);
        return pa == pb;
    }

    vector<Int> get_all_dset() {
        unordered_set<Int> dset;
        for (Int i = 0; i < parent.size(); ++i) {
            dset.insert(find(i));
        } // end i
        vector<Int> v(dset.size());
        Int i = 0;
        for (auto &&d : dset) {
            v[i++] = d;
        } // end d
//        sort(v.begin(), v.end());
        return v;
    }
};


class solver{
    istream& is;
    ostream& os;

public:
    solver(istream& I, ostream& O) :is(I), os(O) {}

    int N, M, K;
    vector<unordered_set<int>> F, B;
    bool input() {
        is >> N >> M >> K;
        F.resize(N); B.resize(N);
        for (int i = 0; i < M; ++i) {
            int a, b;
            is >> a >>b;
            a--; b--;
            F[a].insert(b);
            F[b].insert(a);
        } // end i
        for (int i = 0; i < K; ++i) {
            int a, b;
            is >> a >>b;
            a--; b--;
            B[a].insert(b);
            B[b].insert(a);
        } // end i
        return !!is;
    }

    void run();
};

int main(int argc, char *argv[]) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(16) << scientific;
#ifdef XELMH
    string test_cases = "test_C.txt";
    cerr << test_cases << " -->" << endl;
    auto fs = fstream(test_cases, fstream::in);
    int loop = 0;
    while(fs) {
        loop++;
        cout << '#' << loop << "#------\n";
        solver(fs, cout).run();
    }
    if(loop <= 1) {
        cout << "===" << endl;
        while(cin) solver(cin, cout).run();
    }
#else
    solver(cin, cout).run();
#endif
    return 0;
}


void solver::run(){
    if(!input()) return;

    UFF uf(N);
    for (int v = 0; v < N; ++v) {
        for (auto &&u : F[v]) {
             uf.unite(v, u);
        } // end
    } // end

    unordered_map<int, unordered_set<int>> frs;
    for (int v = 0; v < N; ++v) {
        frs[uf.find(v)].insert(v);
    } // end v

    for (int v = 0; v < N; ++v) {
        int cand = frs[uf.find(v)].size()-1;
        cand-=F[v].size();
        for (auto &&u : B[v]) {
            if(uf.is_same(u, v)) cand--;
        } // end u
        os << cand << ' ';
    } // end v

    os << endl;
}


Measured memory_bytes: 43812