#include <bits/stdc++.h>
using namespace std;

#define int long long
#define itn int
#define For(i, a, b) for (int i = (a); i <= static_cast<int>(b); i++)
#define Forr(i, a, b) for (int i = (a); i >= static_cast<int>(b); i--)
#define rep(i, n) For(i, 0, n - 1)
#define repall(i, arr) for (auto& i : (arr))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define dump(x) cerr << #x << " = " << (x) << '\n'
#define dump2(x, y) \
    cerr << #x << " = " << (x) << " " << #y << " = " << (y) << '\n'
#define SZ(x) ((int)(x).size())
#define bit(n) (1LL << (n))
constexpr int MOD = 1e9 + 7;

template <typename T>
using pq = priority_queue<T>;
template <typename T>
using pqr = priority_queue<T, vector<T>, greater<T>>;
const int INF = LLONG_MAX / 2;
using P = pair<int, int>;
using vec = vector<int>;
template <typename T>
using mat = vector<vector<T>>;

// clang-format off
template <typename T1, typename T2>
ostream& operator<<(ostream& stream, const pair<T1, T2>& p) { return stream << p.first << "," << p.second; }
template <typename T>
void print(const vector<T> vec) { rep (i, vec.size() - 1) cout << vec[i] << ' '; cout << vec[vec.size() - 1] << '\n'; }
template <typename Arg>
void print(const Arg arg) { cout << arg << '\n'; }
template <typename Head, typename... Args>
void print(const Head head, const Args... args) { cout << head << " "; print(args...); }
template <typename T, typename U>
void init(vector<T>& v, vector<U>& w) { rep (i, v.size()) cin >> v[i] >> w[i]; }
template <typename T>
void init(vector<T>& v) { rep (i, v.size()) cin >> v[i]; }
template <typename T>
T sum_(vector<T> vec, T init = 0) { return std::accumulate(all(vec), T(init)); }
template<typename T>
bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template<typename T>
bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <typename T>
int index(const T& vec, const typename T::iterator it) { return distance(vec.begin(), it); }
template <typename T = int>
mat<T> mmat(int n, int m=0) { return mat<T>(n, vector<T>(m)); }
template <typename T = int>
vector<T> ivec(int n) { vector<T> v(n); init(v); return v; }
// clang-format on

void yn(bool tf) { print(tf ? "Yes" : "No"); }
void YN(bool tf) { print(tf ? "YES" : "NO"); }

int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
// -------------------------------------------------------------------
// sort 1 2 3 4
// pqr 1 2 3 must impl >
class UnionFind {
    int root(int x) {
        return parent.at(x) < 0 ? x : parent.at(x) = root(parent.at(x));
    }
    std::vector<int> parent;
    std::vector<int> sz;

public:
    UnionFind(int max) : parent(max + 1, -1), sz(max + 1, 1) {}

    void unite(int x, int y) {
        x = root(x), y = root(y);
        if (x != y) {
            if (parent.at(x) > parent.at(y)) std::swap(x, y);
            if (parent.at(x) == parent.at(y)) parent.at(x)--;
            sz[x] += sz[y];
            parent.at(y) = x;
        }
    }
    int size(int x) { return sz.at(root(x)); }
    bool isFamily(int x, int y) { return root(x) == root(y); }
};

signed main() {
    cin.tie(0), cout.tie(0), ios::sync_with_stdio(false);
    int n, m, k;
    cin >> n >> m >> k;

    UnionFind uf(n + 10);

    int a, b;

    mat<int> sude = mmat<int>(n + 1);
    rep (i, m) {
        cin >> a >> b;
        uf.unite(a, b);
        sude[a].pb(b);
        sude[b].pb(a);
    }

    mat<int> bl = mmat<int>(n + 1);
    int c, d;
    rep (i, k) {
        cin >> c >> d;
        bl[c].pb(d);
        bl[d].pb(c);
    }

    For(i, 1, n) {
        int ans = uf.size(i) - sude[i].size() - 1;
        repall (fri, bl[i]) {
            if (uf.isFamily(i, fri)) ans--;
        }
        cout << ans;
        if (i < n)
            cout << " ";
        else
            cout << endl;
    }

    return 0;
}


Measured memory_bytes: 14580