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)

not_friend_candidates = [1]*N

for _ in range(M):

    A, B = map(int, input().split())

    uf.union(A-1, B-1)

    not_friend_candidates[A-1] += 1

    not_friend_candidates[B-1] += 1

for _ in range(K):

    C, D = map(int, input().split())

    if uf.same(C-1, D-1):

        not_friend_candidates[C-1] += 1

        not_friend_candidates[D-1] += 1

for hito in range(N):

    print(uf.size(hito) - not_friend_candidates[hito], end=" ")

print()

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()}



import sys

input = sys.stdin.readline

N, M, K = list(map(int, input().split()))

uf = UnionFind(N)

ans = [0]*N

not_friend_candidates = [1]*N #自分自身

nfc = not_friend_candidates

for _ in range(M):

    A, B = list(map(int, input().split()))

    uf.union(A-1, B-1)

    nfc[A-1] += 1

    nfc[B-1] += 1

for _ in range(K):

    C, D = list(map(int, input().split()))

    if uf.same(C-1, D-1):

        nfc[C-1] += 1

        nfc[D-1] += 1

ans = [uf.size(i)-nfc[i] for i in range(N)]

print((*ans))

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)
not_friend_candidates = [1] * N
for _ in range(M):
    A, B = map(int, input().split())
    uf.union(A - 1, B - 1)
    not_friend_candidates[A - 1] += 1
    not_friend_candidates[B - 1] += 1
for _ in range(K):
    C, D = map(int, input().split())
    if uf.same(C - 1, D - 1):
        not_friend_candidates[C - 1] += 1
        not_friend_candidates[D - 1] += 1
for hito in range(N):
    print(uf.size(hito) - not_friend_candidates[hito], end=" ")
print()

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()}


import sys

input = sys.stdin.readline
N, M, K = list(map(int, input().split()))
uf = UnionFind(N)
ans = [0] * N
not_friend_candidates = [1] * N  # 自分自身
nfc = not_friend_candidates
for _ in range(M):
    A, B = list(map(int, input().split()))
    uf.union(A - 1, B - 1)
    nfc[A - 1] += 1
    nfc[B - 1] += 1
for _ in range(K):
    C, D = list(map(int, input().split()))
    if uf.same(C - 1, D - 1):
        nfc[C - 1] += 1
        nfc[D - 1] += 1
ans = [uf.size(i) - nfc[i] for i in range(N)]
print((*ans))

-    def __str__(self): -        return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots()) +import sys -N, M, K = map(int, input().split()) +input = sys.stdin.readline +N, M, K = list(map(int, input().split())) -not_friend_candidates = [1] * N +ans = [0] * N +not_friend_candidates = [1] * N  # 自分自身 +nfc = not_friend_candidates -    A, B = map(int, input().split()) +    A, B = list(map(int, input().split())) -    not_friend_candidates[A - 1] += 1 -    not_friend_candidates[B - 1] += 1 +    nfc[A - 1] += 1 +    nfc[B - 1] += 1 -    C, D = map(int, input().split()) +    C, D = list(map(int, input().split())) -        not_friend_candidates[C - 1] += 1 -        not_friend_candidates[D - 1] += 1 -for hito in range(N): -    print(uf.size(hito) - not_friend_candidates[hito], end=" ") -print() +        nfc[C - 1] += 1 +        nfc[D - 1] += 1 +ans = [uf.size(i) - nfc[i] for i in range(N)] +print((*ans))