import queue
n,m,k=map(int,input().split())
root=[[0]*n for i in range(n)]
for i in range(n):
    root[i][i]=2
#print(root)
for i in range(m):
    a,b=map(int,input().split())
   # print("berfot",root[a-1][b-1])
    root[a-1][b-1]=1
    root[b-1][a-1]=1
  #  print("after",root[a-1][b-1])
for i in range(k):
    a,b=map(int,input().split())
 #   print(a,b)
    root[a-1][b-1]=-float("inf")
    root[b-1][a-1]=-float("inf")
#print(root)
toVis=queue.Queue()
Visted=[]
OK={}

for i in range(n):
    Visted=[i]

    if i in OK.keys():
        continue
    toVis=queue.Queue()
    
    for j in range(len(root[i])):
        nex=root[i][j]
        if j not in Visted and nex==1:
            toVis.put(j)

    while toVis.empty()==False:
    
        now=toVis.get()
        if now in Visted:
            continue
     #   print("now :" ,now)
        Visted.append(now)
        for j in range(len(root[now])):
            nex=root[now][j]
            if nex==1 and j not in Visted:
      #          print("apend",nex)
                toVis.put(j)
   
    for j in range(len(Visted)):
        OK[Visted[j]]=Visted
#print(OK)
ans=[]
for i in range(n):
    num=0
    for value in OK[i]:
        if root[i][value]==0:
            num+=1
    ans.append(num)
print(" ".join(map(str,ans)))


    
        