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

typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<double> vd;
typedef vector<vd> vdd;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define debug_print(x...) cerr << "line " << __LINE__ << " : "; debug_print_in(x);

template <typename First>
void debug_print_in(First first){
  cerr << first << endl;
  return;
}

template <typename First, typename... Rest>
void debug_print_in(First first, Rest... rest){
  cerr << first << " ";
  debug_print_in(rest...);
  return;
}

void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

template <typename First>
void OUT(First first){
  cout << first << endl;
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template<class t, class u> void chmax(t&a,u b){if(a<b)a=b;};
template<class t, class u> void chmin(t&a,u b){if(a>b)a=b;};
int popcount(int t){return __builtin_popcount(t);} //GCC
int popcount(ll t){return __builtin_popcountll(t);} //GCC

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cerr << VEC[i] << " ";
  }
  cerr << endl;
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i,MAT.size()){
    REP(j,MAT[i].size()){
      cerr << MAT[i][j] << " ";
    }
    cerr << endl;
  }
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

template <typename NODE>
class Union_Find{
  private:
    ll appear_count=0;
    map<NODE, ll> mp; // map from node to index
    vll par;// parent
    vll rank;// depth
    vll g_size;// group size
    vll e_num;// # of edges for each group
    ll c_num;// # of group

    ll same_private(ll x, ll y){return find(x) == find(y);};

    void unite_private(ll x, ll y){
      x = find(x);
      y = find(y);
      if(x==y){
        e_num[x]++;
        return;
      }
      if(rank[x]==rank[y]) rank[x]++;
      else if(rank[x]>rank[y]) swap(x,y);
      par[x] = y;
      g_size[y] += g_size[x];
      g_size[x] = 0;
      e_num[y] += e_num[x]+1;
      e_num[x] = 0;
      c_num--;
      return;
    }

    //search the root
    ll find(ll x){
      if(par[x] == x){
        return x;
      }else{
        return par[x] = find(par[x]);
      }
    };

    ll Node_to_index(NODE node){
      if(mp.find(node) == mp.end()){
        mp[node] = appear_count;
        appear_count++;
      }
      return mp[node];
    }

  public:
    Union_Find(ll N){
      par.resize(N);
      for(ll i=0; i<N; ++i) par[i] = i;
      rank.resize(N, 0);
      g_size.resize(N, 1);
      e_num.resize(N, 0);
      c_num = N;
      mp.clear();
      return;
    };

    ~Union_Find(void){
      return;
    };


    ll group_size(NODE n){
      return g_size[find(Node_to_index(n))];
    };

    ll edge_num(NODE n){
      return e_num[find(Node_to_index(n))];
    };

    ll cluster_num(void){return c_num;};

    //merge the sets x or y belong
    void unite(NODE n1, NODE n2){
      ll x = Node_to_index(n1);
      ll y = Node_to_index(n2);
      return unite_private(x, y);
    }

    //judge x and y belong the same set or not
    bool same(NODE n1, NODE n2){
      ll x = Node_to_index(n1);
      ll y = Node_to_index(n2);
      return same_private(x, y);
    };
};



int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll N, M, K;
  IN(N,M,K);
  vll A(M), B(M), C(K), D(K);

  Union_Find<ll> que(N);

  vll Z(N, 0);

  REP(m,M){
    IN(A[m], B[m]);
    A[m]--; B[m]--;
    que.unite(A[m], B[m]);
    Z[A[m]]++;
    Z[B[m]]++;
  }

  vll E(N, 0);

  REP(k,K){
    IN(C[k], D[k]);
    C[k]--; D[k]--;
    if(que.same(C[k], D[k])){
      E[C[k]]++;
      E[D[k]]++;
    }
  }

  REP(i,N){
    ll tmp = que.group_size(i);
    printf("%lld ", tmp-1-Z[i]-E[i]);
  }
  printf("\n");

  return 0;
}


Measured memory_bytes: 15360