// Nicky's template
// C
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <inttypes.h>
// C++
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <utility>

using namespace std;

#define FORN(i, n) for (int i = 0; i < int(n); i++)
#define NORF(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define ROF(i, a, b) for (int i = int(b) - 1; i >= a; i--)
#define FORX(it, x) for (auto it = x.begin(); it != x.end(); it++)
#define FORS(i, s) for (int i = 0; s[i]; i++)
#define MS0(x) memset((x), 0, sizeof((x)))
#define MS1(x) memset((x), -1, sizeof((x)))
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;

template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
 
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
// print array
void WA(const int *a, int n) { for (int i = 0; i < n; _W(a[i++])) if (i != 0) putchar(' '); puts(""); }
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }

template<class Iter> ostream &_out(ostream &s, Iter b, Iter e) {
    s << "[";
    for (auto it = b; it != e; it++) s << (it == b ? "" : " ") << *it;
    return s << "]";
}
template<class A, class B> ostream &operator<<(ostream &s, const pair<A, B> &p) { return s << "(" << p.first << ", " << p.second << ")"; }
template<class T> ostream &operator<<(ostream &s, const vector<T> &c) { return _out(s, ALL(c)); }
template<class T, size_t N> ostream &operator<<(ostream &s, const array<T, N> &c) { return _out(s, ALL(c)); }
template<class T> ostream &operator<<(ostream &s, const set<T> &c) { return _out(s, ALL(c)); }
template<class A, class B> ostream &operator<<(ostream &s, const map<A, B> &c) { return _out(s, ALL(c)); }

template<class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) { sort(begin(v), end(v), f); v.resize(unique(begin(v), end(v)) - begin(v)); }
template<class T> inline T bit(T x, int i) { return (x >> i) & 1; }
template<class T> inline bool chmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool chmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;

template<class T> void _dump(const char *s, T &&head) { cerr << s << "=" << head << endl; }
template<class T, class... Args> void _dump(const char *s, T &&head, Args &&... tail) {
    for (int c = 0; *s != ',' || c != 0; cerr << *s++) {
        if (*s == '(' || *s == '[' || *s == '{') c++;
        if (*s == ')' || *s == ']' || *s == '}') c--;
    }
    cerr << "=" << head << ",";
    _dump(s + 1, tail...);
}
#define dump(...) do { fprintf(stderr, "%s:%d - ", __PRETTY_FUNCTION__, __LINE__); _dump(#__VA_ARGS__, __VA_ARGS__); } while (0)

#define MAX 100005
int parent[MAX];
int sz[MAX];
void init() {
    for (int i = 0; i < MAX; i++) {
        parent[i] = i;
        sz[i] = 1;
    }
}
void makeSet(int a) {
    parent[a] = a;
    sz[a] = 1;
}
int find(int a) {
    if (parent[a] == -1) return -1;
    if (parent[a] == a) return a;
    int p = find(parent[a]);
    parent[a] = p;
    return p;
}
void uni(int a, int b) {
    int pa = find(a);
    int pb = find(b);
    if (pa == -1 || pb == -1) return;
    if (pa == pb) return;
    // make pb a smaller one
    if (sz[pa] < sz[pb]) {
        int temp = pa;
        pa = pb;
        pb = temp;
    }
    // merge a smaller one into a larger one
    parent[pb] = pa;
    sz[pa] += sz[pb];
}
int getSize(int a) {
    return sz[find(a)];
}

int main(void)
{
    //ios::sync_with_stdio(0);
    //cin.tie(0);
    init();
    int n, m, k;
    R(n, m, k);
    int fs[m][2], bs[k][2];
    FORN(i, m) {
        R(fs[i][0], fs[i][1]);
        uni(fs[i][0], fs[i][1]);
    }
    FORN(i, k) {
        R(bs[i][0], bs[i][1]);
    }
    //WA(parent, n + 1);
    //WA(s, n + 1);
    int can[n];
    FORN(i, n) {
        can[i] = getSize(i + 1) - 1;
    }
    //WA(can, n);
    FORN(i, m) {
        if (find(fs[i][0]) == find(fs[i][1])) {
            can[fs[i][0] - 1]--;
            can[fs[i][1] - 1]--;
        }
    }
    FORN(i, k) {
        if (find(bs[i][0]) == find(bs[i][1])) {
            can[bs[i][0] - 1]--;
            can[bs[i][1] - 1]--;
        }
    }
    WA(can, n);
	return 0;
}

Measured memory_bytes: 3584