#include<bits/stdc++.h>
#define FILE "read"
#define MAXN 200010
#define cmin(a,b) a=min(a,b)
#define cmax(a,b) a=max(a,b)
using namespace std;
struct node{int y,next;}e[MAXN<<2];
int n,m,Q,len,bcnt,top,dfs_clock,deep[MAXN],Link[MAXN],dfn[MAXN],low[MAXN],sta[MAXN],ans[MAXN],anc[MAXN][25];
vector<int>bcc[MAXN];
inline int read(){
	int x=0,f=1;  char ch=getchar();
	while(!isdigit(ch))  {if(ch=='-')  f=-1;  ch=getchar();}
	while(isdigit(ch))  {x=x*10+ch-'0';  ch=getchar();}
	return x*f;
}
void insert(int x,int y){
	e[++len].next=Link[x];Link[x]=len;e[len].y=y;
	e[++len].next=Link[y];Link[y]=len;e[len].y=x;
}
void tarjan(int x){
	dfn[x]=low[x]=++dfs_clock;  sta[++top]=x;
	for(int i=Link[x];i;i=e[i].next){
		if(!dfn[e[i].y]){
			tarjan(e[i].y);  cmin(low[x],low[e[i].y]);
			if(low[e[i].y]>=dfn[x]){
				bcnt++;  int y;
				do{
					y=sta[top--];
					bcc[bcnt].push_back(y);
				}while(y!=e[i].y);
				bcc[bcnt].push_back(x);
			}
		}else cmin(low[x],dfn[e[i].y]);
	}
}
void dfs1(int x,int fa){
	anc[x][0]=fa;  for(int i=1;i<=20;++i)  anc[x][i]=anc[anc[x][i-1]][i-1];
	for(int i=Link[x];i;i=e[i].next)if(e[i].y!=fa){
		deep[e[i].y]=deep[x]+1; dfs1(e[i].y,x);
	}
}
int lca(int x,int y){
	if(deep[x]<deep[y])  swap(x,y);
	for(int i=20;i>=0;--i)  if(deep[anc[x][i]]>=deep[y])  x=anc[x][i];
	if(x==y)  return x;
	for(int i=20;i>=0;--i)  if(anc[x][i]!=anc[y][i])  x=anc[x][i],y=anc[y][i];
	return anc[x][0];
}
void dfs2(int x,int fa){
	for(int i=Link[x];i;i=e[i].next)if(e[i].y!=fa){
		dfs2(e[i].y,x);  ans[x]+=ans[e[i].y];
	}
}
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	n=read();  m=read();  Q=read();
	for(int i=1;i<=m;++i){
		int x=read(),y=read();
		insert(x,y);
	}
	tarjan(1);  memset(Link,0,sizeof(Link));  len=0;
	for(int i=1;i<=bcnt;++i)for(int j=0;j<bcc[i].size();++j)insert(i+n,bcc[i][j]);
	deep[1]=1;  dfs1(1,0);  
	for(int i=1;i<=Q;++i){
		int x=read(),y=read(),t=lca(x,y);
		ans[x]++;  ans[y]++;  ans[t]--;  ans[anc[t][0]]--;
	}
	dfs2(1,0);
	for(int i=1;i<=n;++i)  printf("%d\n",ans[i]);
	return 0;
}