/**
 * Libraries
 */
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <iomanip>
#include <set>
#include <unordered_map>

#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

using namespace std;

/**
 * macros
 */
#define rep(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define repx(i,s,e,d) for(int i=s,i##_end=(e);i<i##_end;i+=d)
#define repxr(i,s,e,d) for(int i=s,i##_end=(e);i>i##_end;i+=d)
#define rept(n) for(int ___i___=0,i##_len=(n);___i___<i##_len;++___i___)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define ZERO(a) memset(a,0,sizeof(a))
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(),v.end()),v.end());
#define CEIL(x, y) (((x) + (y) - 1) / (y))

/**
 * standard input helpers
 */
// vector
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}
// pair
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
// vector
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "{";
    for (int i = 0; i < vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
// map
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
    os << "{";
    repi(itr, map_var) {
        os << *itr;
        itr++;
        if (itr != map_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// set
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
    os << "{";
    repi(itr, set_var) {
        os << *itr;
        itr++;
        if (itr != set_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
/**
 * debug tools
 */
#define DUMPOUT cout
void dump_func() {
    DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) {
        DUMPOUT << ", ";
    }
    dump_func(std::move(tail)...);
}
#ifdef LOCAL_
#define dump(...)                                                              \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
            << endl                                                            \
            << "    ",                                                         \
        dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif

/**
 * helpers
 */
typedef long long int lli;
typedef pair<int, int> ii;
typedef priority_queue<int, vector<int>, greater<int> > heapq;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
struct aaa{
    aaa(){
        cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);
    };
}aaaaaaa;
// #define int long long int
// struct S{
//     bool operator<(const S& x) const {
//         return ;
//     }
// };
class UnionFindWithSize {
    public:
        UnionFindWithSize(int N) : parent(N, -1) {}
        void unite(int x, int y) {
            x = find(x);
            y = find(y);
            if (x == y) return;
            if (parent[x] > parent[y]) swap(x, y);
            parent[x] += parent[y];
            parent[y] = x;
        }
        int find(int x) {
            if (parent[x] < 0) return x;
            return parent[x] = find(parent[x]);
        }
        int size(int x) {
            return -parent[find(x)];
        }
    private:
        vector<int> parent;
};

// int main() {
//     UnionFindWithSize ufws(5);
//     assert(ufws.size(0) == 1);
//     ufws.unite(0, 1);
//     assert(ufws.find(0) == ufws.find(1));
//     assert(ufws.size(0) == 2);
//     assert(ufws.find(0) != ufws.find(2));
//     ufws.unite(1, 2);
//     assert(ufws.size(0) == 3);
//     assert(ufws.find(0) == ufws.find(2));
//
//     cout << "OK" << endl;
// }
struct User {
    int frd;
    int blk;
    int hoge;
};

signed main() {
    int N, M, K; cin >> N >> M >> K;
    UnionFindWithSize ufws(N);
    vector<User> users(N);
    for (User u: users) {
        u.frd = 0;
        u.blk = 0;
        u.hoge = 0;
    }
    rept(M) {
        int _a, _b; cin >> _a >> _b; _a--; _b--;
        ufws.unite(_a, _b);
        users[_a].frd++; users[_b].frd++;
        users[_a].hoge++; users[_b].hoge++;
    }
    rept(K) {
        int _a, _b; cin >> _a >> _b; _a--; _b--;
        users[_a].blk++; users[_b].blk++;
        if (ufws.find(_a) == ufws.find(_b)) {
            users[_a].hoge++; users[_b].hoge++;
        }
    }

    // map<int, int> ctr;
    // rep(i, N) {
    //     int grpId = ufws.find(i);
    //     users[i].grp = grpId;
    //     ctr[grpId]++;
    // }
    //
    // for(User u: users) {
    //     int num = ctr[u.grp];
    //     cout << num - 1 - u.frd - u.blk << " ";
    // }
    // cout << endl;

    rep(i, N) {
        int num = ufws.size(i);
        cout << num - 1 - users[i].hoge << " ";
    }
    cout << endl;
    return 0;
}



Measured memory_bytes: 2432