import sys

input = sys.stdin.readline





class UnionFind():

    def __init__(self, n):

        self.n = n

        self.parents = [-1] * n

        self.group_count = 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



        self.group_count -= 1



        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 all_group_members(self):

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



def int_(num_str):

    return int(num_str) - 1





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

uf = UnionFind(N)

some = [1] * N

for i in range(M):

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

    uf.union(a, b)

    some[a] += 1

    some[b] += 1

for i in range(K):

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

    if not uf.same(c, d):

        pass

    else:

        some[c] += 1

        some[d] += 1





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

print((*ans))

import sys

input = sys.stdin.readline





class UnionFind():

    def __init__(self, n):

        self.n = n

        self.parents = [-1] * n

        self.group_count = 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



        self.group_count -= 1



        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 all_group_members(self):

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



def int_(num_str):

    return int(num_str) - 1





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

uf = UnionFind(N)

some = [1] * N

for i in range(M):

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

    uf.union(a, b)

    some[a] += 1

    some[b] += 1

for i in range(K):

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

    if uf.same(c, d):

        some[c] += 1

        some[d] += 1





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

print((*ans))

import sys

input = sys.stdin.readline


class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
        self.group_count = 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
        self.group_count -= 1
        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 all_group_members(self):
        return {r: self.members(r) for r in self.roots()}


def int_(num_str):
    return int(num_str) - 1


N, M, K = list(map(int, input().split()))
uf = UnionFind(N)
some = [1] * N
for i in range(M):
    a, b = list(map(int_, input().split()))
    uf.union(a, b)
    some[a] += 1
    some[b] += 1
for i in range(K):
    c, d = list(map(int_, input().split()))
    if not uf.same(c, d):
        pass
    else:
        some[c] += 1
        some[d] += 1
ans = [uf.size(i) - some[i] for i in range(N)]
print((*ans))

import sys

input = sys.stdin.readline


class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
        self.group_count = 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
        self.group_count -= 1
        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 all_group_members(self):
        return {r: self.members(r) for r in self.roots()}


def int_(num_str):
    return int(num_str) - 1


N, M, K = list(map(int, input().split()))
uf = UnionFind(N)
some = [1] * N
for i in range(M):
    a, b = list(map(int_, input().split()))
    uf.union(a, b)
    some[a] += 1
    some[b] += 1
for i in range(K):
    c, d = list(map(int_, input().split()))
    if uf.same(c, d):
        some[c] += 1
        some[d] += 1
ans = [uf.size(i) - some[i] for i in range(N)]
print((*ans))

-    if not uf.same(c, d): -        pass -    else: +    if uf.same(c, d):