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)





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

Friend_Net = UnionFind(N)

Friend = [[] for i in range(N)]

Block = [[] for i in range(N)]

friend = [0] * N



for i in range(M):

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

    friend[A-1] += 1

    friend[B-1] += 1

    Friend[A-1].append(B-1)

    Friend[B-1].append(A-1)

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



for i in range(K):

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

    Block[C-1].append(D-1)

    Block[D-1].append(C-1)



for i in range(N):

    ans = Friend_Net.size(i) - friend[i]

    for b in Block[i]:

        if Friend_Net.same(i, b):

            ans -= 1

    print((ans-1))
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)





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

Friend_Net = UnionFind(N)

Block = [[] for i in range(N)]

friend = [0] * N



for i in range(M):

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

    friend[A-1] += 1

    friend[B-1] += 1

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



for i in range(K):

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

    Block[C-1].append(D-1)

    Block[D-1].append(C-1)



for i in range(N):

    ans = Friend_Net.size(i) - friend[i]

    for b in Block[i]:

        if Friend_Net.same(i, b):

            ans -= 1

    print((ans-1))
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)


N, M, K = list(map(int, input().split()))
Friend_Net = UnionFind(N)
Friend = [[] for i in range(N)]
Block = [[] for i in range(N)]
friend = [0] * N
for i in range(M):
    A, B = list(map(int, input().split()))
    friend[A - 1] += 1
    friend[B - 1] += 1
    Friend[A - 1].append(B - 1)
    Friend[B - 1].append(A - 1)
    Friend_Net.union(A - 1, B - 1)
for i in range(K):
    C, D = list(map(int, input().split()))
    Block[C - 1].append(D - 1)
    Block[D - 1].append(C - 1)
for i in range(N):
    ans = Friend_Net.size(i) - friend[i]
    for b in Block[i]:
        if Friend_Net.same(i, b):
            ans -= 1
    print((ans - 1))

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)


N, M, K = list(map(int, input().split()))
Friend_Net = UnionFind(N)
Block = [[] for i in range(N)]
friend = [0] * N
for i in range(M):
    A, B = list(map(int, input().split()))
    friend[A - 1] += 1
    friend[B - 1] += 1
    Friend_Net.union(A - 1, B - 1)
for i in range(K):
    C, D = list(map(int, input().split()))
    Block[C - 1].append(D - 1)
    Block[D - 1].append(C - 1)
for i in range(N):
    ans = Friend_Net.size(i) - friend[i]
    for b in Block[i]:
        if Friend_Net.same(i, b):
            ans -= 1
    print((ans - 1))

-Friend = [[] for i in range(N)] -    Friend[A - 1].append(B - 1) -    Friend[B - 1].append(A - 1)