#include <bits/stdc++.h>
using namespace std;
typedef long long int llint;
typedef unsigned long long int ullint;
std::string YesNo[] = {"No","Yes"};
#define loop(i,N) for(int i=0; i<(N); i++)
template<typename T>
auto sort_all(T& v) { return std::sort(v.begin(),v.end()); }
template<typename T>
auto sum_all(const T& v) { auto z = v[0]; z = 0;
    return std::accumulate(v.begin(),v.end(),z); }
template<typename T>
auto input( std::size_t N,
            const std::vector<T>& head={},
            const std::vector<T>& tail={}) {
    auto s = head.size();
    auto t = tail.size();
    std::vector<T> v;
    v.reserve(s+N+t);
    v.insert(v.end(), head.begin(), head.end());
    v.resize(s+N);
    loop(i,N) std::cin >> v[s+i];
    v.insert(v.end(), tail.begin(), tail.end());
    return std::move(v);
}
class range {
    typedef int Int;
    Int start, stop, step;
    void initialize() {
        auto sign = (step >= 0) ? 1 : -1;
        stop = start + ((stop-start-sign)/step + 1) * step;
        if ((stop-start) * step <= 0) stop = start;
    }
public:
    range(Int start, Int stop, Int step=1) : start(start), stop(stop), step(step) {
        initialize();
    }
    range(Int stop) : start(0), stop(stop), step(1) { initialize(); }
    struct iterator {
        Int i, step;
        Int& operator*() { return i; }
        iterator& operator++() { i += step; return *this; }
        bool operator!=(const iterator& v) { return i != v.i; }
    };
    iterator begin() { return {start, step}; }
    iterator end()   { return {stop, step}; }
};
template<typename T1, typename T2>
std::pair<T1,T2> operator-(const std::pair<T1,T2>& x)
{
    return std::make_pair(-x.first, -x.second);
}
template<typename T1, typename T2>
std::pair<T1,T2> operator+(
    const std::pair<T1,T2>& x,
    const std::pair<T1,T2>& y)
{
    return std::make_pair(x.first+y.first, x.second+y.second);
}
template<typename T1, typename T2>
std::pair<T1,T2> operator-(const std::pair<T1,T2>& x, const std::pair<T1,T2>& y)
{
    return x + (-y);
}
template<typename T1, typename T2>
std::pair<T1,T2>& operator+=(std::pair<T1,T2>& x, const std::pair<T1,T2>& y)
{
    x.first += y.first;
    x.second += y.second;
    return x;
}
template<typename T1, typename T2>
std::pair<T1,T2>& operator-=(std::pair<T1,T2>& x, const std::pair<T1,T2>& y)
{
    return x += (-y);
}
template<typename T1, typename T2>
std::ostream& operator<<(std::ostream& cout, const std::pair<T1,T2>& data)
{
    cout << "(" << data.first << ", " << data.second << ")";
    return cout;
}
template<typename T>
std::ostream& operator<<(std::ostream& cout, const std::vector<T>& data)
{
    cout << "[";
    if (data.size() == 0) {}
    else if (data.size() == 1) { cout << data[0]; } 
    else {
        cout << data[0];
        for (auto itr=data.begin()+1; itr!=data.end(); ++itr) {
            cout << ", " << *itr;
        }
    }
    cout << "]";
    return cout;
}

class UnionFind
{
private:
    typedef std::vector<int> P;
    P parent;
    // P el;
    int gN;
public:
    UnionFind(int N) : parent(N,-1), gN(N) {}

    auto root(int n) {
        if(parent[n] < 0) {
            return n;
        } else {
            auto m = root(parent[n]);
            parent[n] = m;
            return m;
        }
    }

    auto merge(int m, int n) {
        auto rm = root(m);
        auto rn = root(n);
        if(rm != rn) {
            if(parent[rm] > parent[rn]) {
                auto tmp = rm; rm = rn; rn = tmp;
            }
            parent[rm] += parent[rn];
            parent[rn] = rm;
            gN--;
        }
        return rm;
    }

    auto size(int n) { return -parent[root(n)]; }
    auto connected(int m, int n) { return root(m) == root(n); }
    auto groups_num() { return gN; }
    auto elements_num() { return parent.size(); }
    // const auto& elements() { return el; }
};

typedef llint Int;

int main(void)
{
    int N, M, K;
    cin >> N >> M >> K;
    vector<int> friends(N,0), blocks(N,0);
    UnionFind uf(N);
    for (auto m: range(M)) {
        int a, b;
        cin >> a >> b;
        a--; b--;
        uf.merge(a, b);
        friends[a]++;
        friends[b]++;
    }
    for (auto k: range(K)) {
        int c, d;
        cin >> c >> d;
        c--; d--;
        if (uf.connected(c,d)) {
            blocks[c]++;
            blocks[d]++;
        }
    }

    for (auto n: range(N)) {
        if (n > 0) { cout << " ";}
        cout << uf.size(n) - 1 - friends[n] - blocks[n];
    }
    cout << endl;

    return 0;
}

Measured memory_bytes: 2048