# import bisect

# # import heapq

# # from copy import deepcopy

from collections import deque

# # from collections import Counter

# # from itertools import accumulate

# # from itertools import permutations

# import numpy as np

# # import math



n, m, k = list(map(int, input().split()))

# a = list(map(int, input().split()))

# n = int(input())



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 same(self, x, y):

        return self.find(x) == self.find(y)



    def size(self, x):

        return -self.parents[self.find(x)]



uf = UnionFind(n)

friend =[[] for _ in range(n)]

block = [[] for _ in range(n)]

for i in range(m):

    a,b = list(map(int, input().split()))

    a,b = a-1,b-1

    uf.union(a,b)

    friend[a].append(b); friend[b].append(a)



for i in range(k):

    c,d = list(map(int, input().split()))

    c,d = c-1,d-1

    if uf.same(c,d):

        block[c].append(d); block[d].append(c)



w = [0] * n

for i in range(n):

    w[i] = uf.size(i) - len(friend[i]) - len(block[i]) - 1



print((*w))
# import bisect

# import heapq

# from copy import deepcopy

# from collections import deque

# from collections import Counter

# from itertools import accumulate

# from itertools import permutations

# import numpy as np

# import math



n, m, k = list(map(int, input().split()))

# a = list(map(int, input().split()))

# n = int(input())



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 same(self, x, y):

        return self.find(x) == self.find(y)



    def size(self, x):

        return -self.parents[self.find(x)]



uf = UnionFind(n)

friend =[[] for _ in range(n)]

block = [[] for _ in range(n)]

for i in range(m):

    a,b = list(map(int, input().split()))

    a,b = a-1,b-1

    uf.union(a,b)

    friend[a].append(b); friend[b].append(a)



for i in range(k):

    c,d = list(map(int, input().split()))

    c,d = c-1,d-1

    if uf.same(c,d):

        block[c].append(d); block[d].append(c)



w = [0] * n

for i in range(n):

    w[i] = uf.size(i) - len(friend[i]) - len(block[i]) - 1



print((*w))
# import bisect
# # import heapq
# # from copy import deepcopy
from collections import deque

# # from collections import Counter
# # from itertools import accumulate
# # from itertools import permutations
# import numpy as np
# # import math
n, m, k = list(map(int, input().split()))
# a = list(map(int, input().split()))
# n = int(input())
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 same(self, x, y):
        return self.find(x) == self.find(y)

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


uf = UnionFind(n)
friend = [[] for _ in range(n)]
block = [[] for _ in range(n)]
for i in range(m):
    a, b = list(map(int, input().split()))
    a, b = a - 1, b - 1
    uf.union(a, b)
    friend[a].append(b)
    friend[b].append(a)
for i in range(k):
    c, d = list(map(int, input().split()))
    c, d = c - 1, d - 1
    if uf.same(c, d):
        block[c].append(d)
        block[d].append(c)
w = [0] * n
for i in range(n):
    w[i] = uf.size(i) - len(friend[i]) - len(block[i]) - 1
print((*w))

# import bisect
# import heapq
# from copy import deepcopy
# from collections import deque
# from collections import Counter
# from itertools import accumulate
# from itertools import permutations
# import numpy as np
# import math
n, m, k = list(map(int, input().split()))
# a = list(map(int, input().split()))
# n = int(input())
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 same(self, x, y):
        return self.find(x) == self.find(y)

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


uf = UnionFind(n)
friend = [[] for _ in range(n)]
block = [[] for _ in range(n)]
for i in range(m):
    a, b = list(map(int, input().split()))
    a, b = a - 1, b - 1
    uf.union(a, b)
    friend[a].append(b)
    friend[b].append(a)
for i in range(k):
    c, d = list(map(int, input().split()))
    c, d = c - 1, d - 1
    if uf.same(c, d):
        block[c].append(d)
        block[d].append(c)
w = [0] * n
for i in range(n):
    w[i] = uf.size(i) - len(friend[i]) - len(block[i]) - 1
print((*w))

-# # import heapq -# # from copy import deepcopy -from collections import deque - -# # from collections import Counter -# # from itertools import accumulate -# # from itertools import permutations +# import heapq +# from copy import deepcopy +# from collections import deque +# from collections import Counter +# from itertools import accumulate +# from itertools import permutations -# # import math +# import math