#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(long long i=0;i<(n);i++)
#define REP1(i,n) for(long long i=1;i<=(n);i++)
#define REP2D(i,j,h,w) for(long long i=0;i<(h);i++) for(long long j=0;j<(w);j++)
#define REP2D1(i,j,h,w) for(long long i=1;i<=(h);i++) for(long long j=1;j<=(w);j++)
#define PER(i,n) for(long long i=((n)-1);i>=0;i--)
#define PER1(i,n) for(long long i=(n);i>0;i--)
#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define FORE(i,a,b) for(long long i=(a);i<=(b);i++)
#define ITE(arr) for(auto ite=(arr).begin();ite!=(arr).end();++ite)
#define ALL(a) ((a).begin()),((a).end())
#define RANGE(a) (a),((a)+sizeof(a))
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define YNPRT(b) cout<<((b)?"Yes":"No")<<endl
#define ENTER printf("\n")
#define REV(arr) reverse(ALL(arr))
#define PRT(a) cout<<(a)<<endl

#ifdef DEBUG
#define DBPRT(a) cout << "[Debug] - " << #a << " : " << (a) << endl
#define DBSTART if(1){
#define DBEND }
#define PRTLST(arr,num) REP(_i,num) cout<<_i<<" - "<<arr[_i]<<endl;
#define PRTLST2(arr2,d1,d2) REP(_i,d1) REP(_j,d2) cout<<_i<<","<<_j<<" : "<<arr2[_i][_j]<<endl;
#define PRTLST2D(arr2,d1,d2) do{cout<<"L\t";REP(_i,d2) cout<<_i<<"\t"; cout<<endl; REP(_i,d1){cout<<_i<<"\t";REP(_j,d2){cout<<arr2[_i][_j]<<"\t";}cout<<endl;}}while(0);
#else
#define DBPRT(a) if(0){}
#define DBSTART if(0){
#define DBEND }
#define PRTLST(arr,num) if(0){}
#define PRTLST2(arr2,d1,d2) if(0){}
#define PRTLST2D(arr2,d1,d2) if(0){}
#endif

#define TOSUM(arr,sum,n) {sum[0]=arr[0];REP1(i,n-1) sum[i]=sum[i-1]+arr[i];}

#define MIN(target,v1) (target)=min(target,v1)
#define MAX(target,v1) (target)=max(target,v1) 
#define P1 first
#define P2 second
#define PB push_back
#define UB upper_bound
#define LB lower_bound
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int INF_INT = 2147483647;
const ll INF_LL = 9223372036854775807LL;
const ull INF_ULL = 18446744073709551615Ull;
const ll P = 92540646808111039LL;
const int Move[4][2] = {-1,0,0,1,1,0,0,-1};
const int Move_[8][2] = {-1,0,-1,-1,0,1,1,1,1,0,1,-1,0,-1,-1,-1};
template<typename T1,typename T2>
ostream& operator<<(ostream& os,const pair<T1,T2>& p) {os<<"( "<<p.P1<<" , "<<p.P2<<" )";return os;}
template<typename T>
ostream& operator<<(ostream& os,const vector<T>& v) {ITE(v) os << (ite-v.begin()) << " : " << *ite <<endl;return os;}
template<typename T>
ostream& operator<<(ostream& os,const set<T>& v) {os<<" { ";ITE(v) {os<<*ite;if(ite!=--v.end()){os<<" , ";}} os<<" } ";return os;}
template<typename T1,typename T2>
ostream& operator<<(ostream& os,const map<T1,T2>& m) {ITE(m) {os<<ite->P1<<"\t\t|->\t\t"<<ite->P2<<endl;} return os;}

//---------------------
#define MAXN 100005
#define MAXUF 100005
typedef ll uf_val;
//---------------------
uf_val uf_par[MAXUF];
ll uf_rank[MAXUF];

void uf_init(){ // Initialize Union-find set
	REP(i,MAXUF){
		uf_par[i]=uf_val(i);
		uf_rank[i]=1;
	}
}

uf_val uf_find(const uf_val& a){ // Find parent
	return (uf_par[a]==a)?(a):(uf_par[a]=uf_find(uf_par[a])); // Compress path
}

void uf_unite(const uf_val& a, const uf_val& b){
	auto x = uf_find(a), y = uf_find(b);
	if(x==y) return;
	if (uf_rank[x]<uf_rank[y]) {uf_par[x]=y; uf_rank[y]+=uf_rank[x];}
	else {uf_par[y]=x; uf_rank[x]+=uf_rank[y];}
}

bool uf_same(const uf_val& a,const uf_val& b){
	return uf_find(a) == uf_find(b);
}

ll n,m,k;
vector<ll> rlst[MAXN];
vector<ll> blst[MAXN];
ll rn[MAXN];
ll res[MAXN];

int main(){
  	uf_init();
  	ZERO(rn);
  	ZERO(res);
  	/*uf_unite(1,3);
  	uf_unite(3,7);
  	uf_unite(5,8);
  	REP(i,MAXUF) cout<<i<<" root : "<<uf_find(i)<<endl;*/
  	cin >> n >> m >> k;
  	REP1(i,m){
  		ll a,b;
  		cin >> a >> b;
  		rlst[a].PB(b);rlst[b].PB(a);
  		uf_unite(a,b);
  	}

  	REP1(i,k){
  		ll a,b;
  		cin >> a >> b;
  		blst[a].PB(b);blst[b].PB(a);
  	}
  	
  	REP1(i,n){
  		ll rt = uf_find(i);
  		rn[rt]++;
  	}

  	REP1(i,n){
  		ll rt = uf_find(i);
  		res[i] = rn[rt]-1;
  	}

  	REP1(i,n){
  		ITE(rlst[i]){
  			res[*ite]--;
  		}
  		ITE(blst[i]){
  			if(uf_same(i, *ite)) res[*ite]--;
  		}
  	}

  	REP1(i,n) printf("%lld ",res[i]);
  	ENTER;
	return 0;
}








Measured memory_bytes: 16116