#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define uni(x) x.erase(unique(rng(x)),x.end())
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define dup(x,y) (((x)+(y)-1)/(y))
#define v(T) vector<T>
#define vv(T) v(v(T))
using ll = int64_t;
using ull = uint64_t;
using uint = uint32_t;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(v.size())o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
const double eps = 1e-6;
const ll LINF = 100200300400500600ll;
const int INF = 1001001001;
//--------------------------------------------------------
#define fastio cin.tie(nullptr); std::ios::sync_with_stdio(false);
#define myio ifstream iofi; if(argc>1){iofi.open(argv[1]); std::cin.rdbuf(iofi.rdbuf());}
#define myloopset int loop = 1; if(argc>2) loop =stoi(argv[2]); rep(i,loop)
//--------------------------------------------------------------
template <class T> T chmin(T &a,T b){if(a>b){a=b; return 1;}else return 0;}
template <class T> T chmax(T &a,T b){if(a<b){a=b; return 1;}else return 0;}
const int dx[4] = {0,1,0,-1};
const int dy[4] = {-1,0,1,0};
const int mod = 1000000007;

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

  DisjointSet(){}
  DisjointSet(int size) {
    rank.resize(size,0);
    p.resize(size,0);
    nf.resize(size,0);
    sz.resize(size,1);
    for(int i=0; i<size;i++) 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) {
    link(findSet(x), findSet(y));
  }

  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 size(int x){
    return sz[findSet(x)];
  }

  int findSet(int x) {
    if(x != p[x]) {
      p[x] = findSet(p[x]);
    }
    return p[x];
  }
};

void Main(){
  int n,m,k;
  cin>>n>>m>>k;

  DisjointSet ds(n);
  rep(i,m){
    int a,b;
    cin>>a>>b; a--; b--;
    if(ds.same(a,b)){
      ds.nf[a]++;
      ds.nf[b]++;
    }else{
      ds.nf[a]++;
      ds.nf[b]++;
      ds.unite(a,b);
    }
  }
  rep(i,k){
    int a,b;
    cin>>a>>b; a--; b--;
    if(ds.same(a,b)){
      ds.nf[a]++;
      ds.nf[b]++;
    }
  }

  rep(i,n){
    cout<<ds.size(i)-ds.nf[i]-1<<" ";
  }
  cout<<endl;

} signed main(int argc,char** argv)
{fastio; myio; myloopset Main();}


Measured memory_bytes: 3712