/*
Author : N_o_o_B
Created : March 01 2020 18:05:33 
*/
#include <bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
#define TRACE
#ifdef TRACE
#define trace(...) { cerr<<"[ "; __trace__(#__VA_ARGS__, __VA_ARGS__);}
#undef endl
template <typename Arg1,typename Arg2>
ostream& operator << (ostream& out, const pair<Arg1,Arg2> &x) {
    return out<<"("<<x.first<<","<<x.second<<")";
}
 
template <typename Arg1>
ostream& operator << (ostream& out, const vector<Arg1> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1>
ostream& operator << (ostream& out, const set<Arg1> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1,typename Arg2>
ostream& operator << (ostream& out, const map<Arg1,Arg2> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1>
void __trace__(const string name, Arg1&& arg1){
    cerr << name << " : " << arg1 << " ] " << endl;
}
 
template <typename Arg1, typename... Args>
void __trace__(const string names, Arg1&& arg1, Args&&... args){
    const string name = names.substr(0,names.find(','));
    cerr<<name<<" : "<<arg1<<" | ";
    __trace__(names.substr(1+(int)name.size()), args...);
}
#else
    #define trace(args...)
#endif
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pair<int,int>> vii;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<pair<ll,ll>> vll;
typedef vector<vl> vvl;
//typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> oset;
#define fori(i,n) for(int i=0;i<n;i++)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define repd(i,a,b) for(int i=a;i>=b;i--)
#define ford(i,n)  for(int i=n-1;i>=0;i--)
#define trav(x,a) for(auto& x:a)
#define all(x) x.begin(),x.end()
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define fi first
#define se second
clock_t time_p=clock();
void time_taken()
{
    time_p=clock()-time_p;
    cerr<<"Time Taken : "<<(float)(time_p)/CLOCKS_PER_SEC<<"\n";
}
//const ll mod=998244353;
const ll mod=1e9+7;
const ll INF=1e18;
struct UF{
    int n;
    vector<int> par;
    vector<int> num;
    UF(int n) : n(n){
        for(int i=0;i<n;i++) par.push_back(i);
        for(int i=0;i<n;i++) num.push_back(1); 
    }
    int find(int a){
        if(a!=par[a]) par[a]=find(par[a]);
        return par[a];
    }
    bool merge(int a,int b){
        if(find(a) == find(b)) return 0;
        int x = find(a),y = find(b);
        if(num[x] < num[y]) swap(x,y);
        par[y]=x;
        num[x]+=num[y];
        return 1;
    }
};
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    cout.precision(12);cout << fixed;

    int n;
    cin >> n;
    UF dsu(n);
    int m,k;
    cin >> m >> k;
    vi adj1[n],adj2[n];
    while(m--){
        int u,v;
        cin >> u >> v;
        u--;v--;
        dsu.merge(u,v);
        adj1[u].pb(v);
        adj1[v].pb(u);
    }
    while(k--){
        int u,v;
        cin >> u >> v;
        u--;v--;
        adj2[u].pb(v);
        adj2[v].pb(u);
    }
    fori(i,n){
        int ans = dsu.num[dsu.find(i)] - sz(adj1[i]) - 1;
        for(int x:adj2[i]){
            ans -= (dsu.find(i) == dsu.find(x));
        }
        cout << ans << " ";
    }
    cout << endl;


    time_taken();
    return 0;
}

Measured memory_bytes: 12664