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

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

uf = UnionFind(N)

friend = [[False]*N for _ in range(N)]

for i in range(M):
    a, b = list(map(int, input().split()))
    a -= 1
    b -= 1
    uf.union(a, b)
    friend[a][b] = True
    friend[b][a] = True

block = [[False]*N for _ in range(N)]

for i in range(K):
    c, d = list(map(int, input().split()))
    c -= 1
    d -= 1
    block[c][d] = True
    block[d][c] = True

res = []
for i in range(N):
    g = uf.members(i)
    cnt = -1
    for x in g:
        if friend[i][x] or block[i][x]:
            continue
        cnt += 1
    res.append(str(cnt))

print((" ".join(res)))

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

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]

uf = UnionFind(N)

friend = [[False]*N for _ in range(N)]

for i in range(M):
    a, b = list(map(int, input().split()))
    a -= 1
    b -= 1
    uf.union(a, b)
    friend[a][b] = True
    friend[b][a] = True

block = [[False]*N for _ in range(N)]

for i in range(K):
    c, d = list(map(int, input().split()))
    c -= 1
    d -= 1
    block[c][d] = True
    block[d][c] = True

res = []
for i in range(N):
    g = uf.members(i)
    cnt = -1
    for x in g:
        if friend[i][x] or block[i][x]:
            continue
        cnt += 1
    res.append(str(cnt))

print((" ".join(res)))