#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <limits>
#include <time.h>
#include <cstdint>
using namespace std;
using pii  = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rRep(i,a,b) for(ll i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
  if('0' <= c && c <= '9') return (c-'0');
  return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template <class T, class U> inline bool chmax(T& lhs, const U& rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; }
template <class T, class U> inline bool chmin(T& lhs, const U& rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
  for(auto i=begin(v); i != end(v); ++i){
    if(i !=begin(v)) os << ' ';
    os << *i;
  }
  return os;
}

class DisjointSet{
  public:
    vector<int> rank,p,sz;

    DisjointSet(){}

    //初期化
    DisjointSet(int size){
      rank.resize(size,0);
      p.resize(size,0);
      sz.resize(size,1);
      rep(i,size){
        makeSet(i);
      }
    }        
    void makeSet(int x){
      p[x]=x;
      rank[x]=0;
    }

    bool same(int x,int y){
      return findSet(x)==findSet(y);
    }

    void unite(int x,int y){
      if(!same(x,y)) link(findSet(x),findSet(y));
    }

    int size(int key){
      return sz[findSet(key)];
    }

    void link(int x,int y){
      if(rank[x]>rank[y]){
        p[y]=x;
        sz[x]+=sz[y];
      }
      else{
        p[x]=y;
        sz[y]+=sz[x];
        if(rank[x]==rank[y]){
            rank[y]++;
        }
      }
    }

    int findSet(int x){ // 根を返す
      if(x!=p[x]){
        p[x]=findSet(p[x]);
      }
      return  p[x];
    }
};

ll N,M,K,A[100007],B[100007];

int main(){
  cin >> N >> M >> K;
  DisjointSet X;
  X=DisjointSet(N+1);  // N頂点(0-indexed)を用意
  rep(i,M){
    ll S,T;
    cin >> S >> T;
    A[S]++;
    A[T]++;
    X.unite(min(S,T),max(S,T));
  }
  rep(i,K){
    ll S,T;
    cin >> S >> T;
    if(X.same(S,T)){
      B[S]++;
      B[T]++;
    }
  }
  Rep(i,1,N+1){
    cout << X.size(i)-A[i]-B[i]-1 << " ";
  }
  cout  << endl;
}


Measured memory_bytes: 3584