import sys

read = sys.stdin.buffer.read

readline = sys.stdin.buffer.readline

readlines = sys.stdin.buffer.readlines

sys.setrecursionlimit(10 ** 7)





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 = list(map(int, readline().split()))

ab = [list(map(int, readline().split())) for _ in range(m)]

cd = [list(map(int, readline().split())) for _ in range(k)]

uf_p = UnionFind(n + 1)

for a, b in ab:

    uf_p.union(a, b)

ans = [uf_p.size(i) - 1 for i in range(1, n + 1)]

for a, b in ab:

    ans[a - 1] -= 1

    ans[b - 1] -= 1

for c, d in cd:

    if uf_p.same(c, d):

        ans[c - 1] -= 1

        ans[d - 1] -= 1

print((*ans))

import sys

read = sys.stdin.buffer.read

readline = sys.stdin.buffer.readline

readlines = sys.stdin.buffer.readlines

sys.setrecursionlimit(10 ** 7)





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 = list(map(int, readline().split()))

ab = [list(map(int, readline().split())) for _ in range(m)]

cd = [list(map(int, readline().split())) for _ in range(k)]

uf = UnionFind(n + 1)

cnt = [-1] * n

for a, b in ab:

    uf.union(a, b)

for i in range(n):

    cnt[i] += uf.size(i + 1)



for a, b in ab:

    cnt[a - 1] -= 1

    cnt[b - 1] -= 1

for c, d in cd:

    if uf.same(c, d):

        cnt[c - 1] -= 1

        cnt[d - 1] -= 1

print((*cnt))

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)


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 = list(map(int, readline().split()))
ab = [list(map(int, readline().split())) for _ in range(m)]
cd = [list(map(int, readline().split())) for _ in range(k)]
uf_p = UnionFind(n + 1)
for a, b in ab:
    uf_p.union(a, b)
ans = [uf_p.size(i) - 1 for i in range(1, n + 1)]
for a, b in ab:
    ans[a - 1] -= 1
    ans[b - 1] -= 1
for c, d in cd:
    if uf_p.same(c, d):
        ans[c - 1] -= 1
        ans[d - 1] -= 1
print((*ans))

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)


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 = list(map(int, readline().split()))
ab = [list(map(int, readline().split())) for _ in range(m)]
cd = [list(map(int, readline().split())) for _ in range(k)]
uf = UnionFind(n + 1)
cnt = [-1] * n
for a, b in ab:
    uf.union(a, b)
for i in range(n):
    cnt[i] += uf.size(i + 1)
for a, b in ab:
    cnt[a - 1] -= 1
    cnt[b - 1] -= 1
for c, d in cd:
    if uf.same(c, d):
        cnt[c - 1] -= 1
        cnt[d - 1] -= 1
print((*cnt))

-uf_p = UnionFind(n + 1) +uf = UnionFind(n + 1) +cnt = [-1] * n -    uf_p.union(a, b) -ans = [uf_p.size(i) - 1 for i in range(1, n + 1)] +    uf.union(a, b) +for i in range(n): +    cnt[i] += uf.size(i + 1) -    ans[a - 1] -= 1 -    ans[b - 1] -= 1 +    cnt[a - 1] -= 1 +    cnt[b - 1] -= 1 -    if uf_p.same(c, d): -        ans[c - 1] -= 1 -        ans[d - 1] -= 1 -print((*ans)) +    if uf.same(c, d): +        cnt[c - 1] -= 1 +        cnt[d - 1] -= 1 +print((*cnt))