### BUGGY CODE ###

import queue
def main():
    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=[]
    checkOK=[0 for i in range(n)]
    OK={}
    checkVis=[0 for i in range(n)]
    checkVinit=checkVis
    for i in range(n):
        checkVis=checkVinit
        Visted=[i]
        checkVis[i]=5


        if checkOK[i]==5:
            continue
        toVis=queue.Queue()
        
        for j in range(len(root[i])):
            nex=root[i][j]
        # if j not in Visted and nex==1:
            if checkVis[j]!=5 and nex==1:
                toVis.put(j)

        while toVis.empty()==False:
        
            now=toVis.get()
            #if now in Visted:
            if checkVis[now]==5:
                continue
        #   print("now :" ,now)
            Visted.append(now)
            checkVis[now]=5
            for j in range(n):#len(rooot[now]
                nex=root[now][j]
                #if nex==1 and j not in Visted:
                if nex==1 and checkVis[j]!=5:
        #          print("apend",nex)
                    toVis.put(j)
    
        for j in Visted:
            OK[j]=Visted
            checkOK[j]=5
    #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)))
if __name__=="__main__":
    main()

    

### FIXED CODE ###

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


n,m,k=map(int,input().split())
uf=UnionFind(n)
block={}
for i in range(n):
    block[i]=[i]
for i in range(m):
    a,b=map(int,input().split())
    uf.union(a-1,b-1)
    block[a-1].append(b-1)
    block[b-1].append(a-1)
    
for i in range(k):
    a,b=map(int,input().split())
    block[a-1].append(b-1)
    block[b-1].append(a-1)
ans=[]
#print(block)
for i in range(n):
    res=uf.size(i)
 #   print(res)
    for value in block[i]:
        if uf.same(value,i):
            res-=1
    ans.append(res)
print(*ans)