/********************************
* AUTHOR:  ARNAB SEN             *
* NICK  :  arnab1729             *
* INSTITUTION: IIEST, SHIBPUR    *
********************************/

#include<bits/stdc++.h>

using namespace std;

typedef string                         STR;
typedef long long                      LL;
typedef long double                    LD;
typedef unsigned long long             ULL;
typedef vector<int>                    VI;
typedef priority_queue<int>            PQI;
typedef vector<LL>                     VLL;
typedef vector<ULL>                    VULL;
typedef vector<STR>                    VS;
typedef vector<char>                   VC;
typedef pair<int,int>                  PII;
typedef pair<LL,LL>                    PLL;
typedef pair<STR,int>                  PSI;
typedef pair<int,STR>                  PIS;
typedef vector<PII>                    VPII;
typedef vector<PLL>                    VPLL;
typedef map<int,int>                   MII;
typedef map<LL,LL>                     MLL;
typedef map<STR,int>                   MSI;
typedef map<char,int>                  MCI;
typedef map<int,STR>                   MIS;
typedef set<STR>                       SS;
typedef set<int>                       SI;
typedef set<LL>                        SLL;

#define FF                             first
#define SS                             second
#define PB                             push_back
#define PF                             push_front
#define MP                             make_pair
#define all(a)                         (a).begin(), (a).end()
#define dec(n)                         cout<<fixed<<setprecision(n);
#define f(i, n)                        for(LL i=0; i<(LL)n; i++)
#define fr(i,n)                        for(LL i=(LL)(n-1); i>=0; i--)
#define fa(i, a, n)                     for(LL i=(LL)a; i<(LL)n; i++)
#define fra(i, a, n)                    for(LL i=(LL)(n-1); i>=a; i--)
#define fsort(a)                       sort(a.begin(), a.end())
#define rsort(a)                       sort(a.rbegin(), a.rend())


#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);srand(time(NULL))

template<class T>  T maxT(T a, T b){return (a>b?a:b);}
template<class T>  T minT(T a, T b){return (a<b?a:b);}
template<class T>  void setmax(T &a, T b){a=(a>b ?a:b);}
template<class T>  void setmin(T &a, T b){a=(a<b ?a:b);}

void fileio(){
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    freopen("debug.txt", "w", stderr);
}

void ofileio(){
  freopen("input.txt","r", stdin);
  freopen("output.txt", "w", stdout); 
}

void clock_out(){
  cerr<<"\nTime Elapsed : " << 1.0*clock() / CLOCKS_PER_SEC << " s\n";
}


void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << H;
  debug_out(T...);
}
 
#ifndef ONLINE_JUDGE
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define fio() fileio()
#define ofio ofileio()
#define clock() clock_out()
#else
#define debug(...) 1
#define fio() 1
#define ofio() ofileio()
#define clock() 1
#endif

const LL MOD     = 1000000007;
const LL SIZE    = 100000;
const int INF    = 0x3f3f3f3f;
const LL LL_INF  = 0x3f3f3f3f3f3f3f3f;
const LD PI      = acos(-1);
const LL MAXN    = numeric_limits<LL>::max();

vector<vector<LL>> adj;
vector<vector<LL>> blk;
vector<LL> comp;
vector<LL> vis;
vector<bool> vis2;



void dfs(LL src, LL &count, LL id){
  for(auto edge: adj[src]){
    if(vis[edge]==-1){
      vis[edge]=id;
      count++;
      dfs(edge, count, id);
    }
  }
}

void dfsAssign(LL src, LL count){
  comp[src]=count;
  for(auto edge: adj[src]){
    if(!vis2[edge]){
      vis2[edge]=true;
      dfsAssign(edge, count);
    }
  }
}

void solve(){
   LL n, m, k;
   cin>>n>>m>>k;
   
   adj.resize(n+1);
   blk.resize(n+1);
   comp.resize(n+1, 1);
   f(i, m){
      LL a, b;
      cin>>a>>b;
      adj[a].PB(b);
      adj[b].PB(a);
   }

   f(i, k){
      LL c, d;
      cin>>c>>d;
      blk[c].PB(d);
      blk[d].PB(c);
   }
   vis.resize(n+1, -1);
   vis2.resize(n+1, false);
   LL id=1;
   for(LL i=1; i<=n; i++){
    if(vis[i]==-1){
        LL count=0;
        dfs(i, count, id);
        dfsAssign(i, count);
        id++;
      }
   }

   for(LL i=1; i<=n; i++){
      if(comp[i]==0) comp[i]=1;
   }

  for(LL i=1; i<=n; i++){
    LL ans=comp[i]-adj[i].size()-1;
    for(auto edge: blk[i]){
      // debug(vis[edge], vis[i]);
      if(vis[edge] == vis[i]) ans--;
    }

    // debug();
    cout<<max(ans, 0LL)<<" ";
  }

}

int main(){
  fast;
  //fio();

  LL t=1;
  //cin>>t;
  while(t--){
      solve();
  }
  clock();
  return 0;
}


Measured memory_bytes: 15232