Buggy python submission (verdict: Time Limit Exceeded):
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 = map(int, input().split())
friend = UnionFind(n)
dataf = [set() for _ in range(n)]
datab = [set() for _ in range(n)]
for _ in range(m):
    a, b = map(int, input().split())
    dataf[a-1].add(b-1)
    dataf[b-1].add(a-1)
    friend.union(a-1, b-1)

for _ in range(k):
    a, b = map(int, input().split())
    datab[a-1].add(b-1)
    datab[b-1].add(a-1)

for i in range(n):
    kouho = set(friend.members(i))
    print(len(kouho-dataf[i]-datab[i])-1, end=' ')


Fixed submission:
from collections import defaultdict


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 = map(int, input().split())
friend = UnionFind(n)
dataf = defaultdict(lambda: 0)

for _ in range(m):
    a, b = map(int, input().split())
    dataf[a-1] += 1
    dataf[b-1] += 1
    friend.union(a-1, b-1)

for _ in range(k):
    a, b = map(int, input().split())
    if friend.same(a-1, b-1):
        dataf[a-1] += 1
        dataf[b-1] += 1

for i in range(n):
    kouho = friend.size(i)
    print(kouho-dataf[i]-1, end=' ')

Buggy python submission (verdict: Time Limit Exceeded):
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 = map(int, input().split())
friend = UnionFind(n)
dataf = [set() for _ in range(n)]
datab = [set() for _ in range(n)]
for _ in range(m):
    a, b = map(int, input().split())
    dataf[a-1].add(b-1)
    dataf[b-1].add(a-1)
    friend.union(a-1, b-1)

for _ in range(k):
    a, b = map(int, input().split())
    datab[a-1].add(b-1)
    datab[b-1].add(a-1)

for i in range(n):
    kouho = set(friend.members(i))
    print(len(kouho-dataf[i]-datab[i])-1, end=' ')


Fixed submission:
from collections import defaultdict


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 = map(int, input().split())
friend = UnionFind(n)
dataf = defaultdict(lambda: 0)

for _ in range(m):
    a, b = map(int, input().split())
    dataf[a-1] += 1
    dataf[b-1] += 1
    friend.union(a-1, b-1)

for _ in range(k):
    a, b = map(int, input().split())
    if friend.same(a-1, b-1):
        dataf[a-1] += 1
        dataf[b-1] += 1

for i in range(n):
    kouho = friend.size(i)
    print(kouho-dataf[i]-1, end=' ')