### BUGGY CODE ###

from collections import *
from itertools import *
from bisect import *
from heapq import *
import copy
#import math

#N=int(input())
#X,Y=map(int,input().split())
#S=list(map(int,input().split()))
#S=[list(map(int,input().split())) for i in range(N)]
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())
AB=[list(map(int,input().split())) for i in range(M)]
for i in range(M):
    AB[i][0]-=1
    AB[i][1]-=1
CD=[list(map(int,input().split())) for i in range(K)]
for i in range(K):
    CD[i][0]-=1
    CD[i][1]-=1


uf=UnionFind(N)
for a,b in AB:
    uf.union(a,b)

fblst=[set() for i in range(N)]
for a,b in AB+CD:
    fblst[a].add(b)
    fblst[b].add(a)

dic={}
lst=[0 for i in range(N)]
for i in uf.roots():
    a=set(uf.members(i))
    dic.update({i:a})
    for m in a:
        lst[m]=i

for i in range(len(lst)):
    root=lst[i]
    lst[i]=len(dic[root]-fblst[i])-1

print(" ".join(list(map(str,lst))))


### FIXED CODE ###

from collections import *
from itertools import *
from bisect import *
from heapq import *
import copy
#import math

#N=int(input())
#X,Y=map(int,input().split())
#S=list(map(int,input().split()))
#S=[list(map(int,input().split())) for i in range(N)]
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())
AB=[list(map(int,input().split())) for i in range(M)]
for i in range(M):
    AB[i][0]-=1
    AB[i][1]-=1
CD=[list(map(int,input().split())) for i in range(K)]
for i in range(K):
    CD[i][0]-=1
    CD[i][1]-=1


uf=UnionFind(N)
fblst=[set() for i in range(N)]
blocklst=[0 for i in range(N)]
for a,b in AB:
    uf.union(a,b)
    fblst[a].add(b)
    fblst[b].add(a)


for c,d in CD:
    if uf.same(c,d):
        blocklst[c]+=1
        blocklst[d]+=1

lst=[]
for i in range(N):
    lst.append(uf.size(i)-len(fblst[i])-blocklst[i]-1)


print(" ".join(list(map(str,lst))))