Buggy python submission (verdict: Time Limit Exceeded):
N, M, K = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(M)]
CD = [list(map(int, input().split())) for _ in range(K)]

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_friend = UnionFind(N)

# es_friend = [[False for _ in range(N)] for _ in range(N)]
# es_block = [[False for _ in range(N)] for _ in range(N)]
es_friend = [[] for _ in range(N)]
es_block = [[] for _ in range(N)]

for i in range(M):
    uf_friend.union(AB[i][0]-1, AB[i][1]-1)
    es_friend[AB[i][0]-1].append(AB[i][1]-1)
    es_friend[AB[i][1]-1].append(AB[i][0]-1)
for i in range(K):
    es_block[CD[i][0]-1].append(CD[i][1]-1)
    es_block[CD[i][1]-1].append(CD[i][0]-1)

ans = [0 for _ in range(N)]
for root in uf_friend.roots():
    m = uf_friend.members(root)
    l = len(uf_friend.members(root))
    for i in range(l):
        for j in range(i+1, l):
            # if es_friend[m[i]][m[j]] == es_block[m[i]][m[j]] == False:
            if m[j] not in es_friend[m[i]] and m[j] not in es_block[m[i]]:
                ans[m[i]] += 1
                ans[m[j]] += 1
print(" ".join(list(map(str, ans))))


Fixed submission:
N, M, K = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(M)]
CD = [list(map(int, input().split())) for _ in range(K)]

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_friend = UnionFind(N)
uf_block = UnionFind(N)

es_friend = [0 for _ in range(N)]
es_block = [0 for _ in range(N)]

for i in range(M):
    uf_friend.union(AB[i][0]-1, AB[i][1]-1)
    es_friend[AB[i][0]-1] += 1
    es_friend[AB[i][1]-1] += 1
for i in range(K):
    uf_block.union(CD[i][0]-1, CD[i][1]-1)
for i in range(K):
    if uf_friend.same(CD[i][0]-1, CD[i][1]-1):
        es_block[CD[i][0]-1] += 1
        es_block[CD[i][1]-1] += 1


ans = [0 for _ in range(N)]
for i in range(N):
    ans[i] = uf_friend.size(i) - es_friend[i] - es_block[i] - 1

print(" ".join(list(map(str, ans))))

Buggy python submission (verdict: Time Limit Exceeded):
N, M, K = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(M)]
CD = [list(map(int, input().split())) for _ in range(K)]

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_friend = UnionFind(N)

es_friend = [[False for _ in range(N)] for _ in range(N)]
es_block = [[False for _ in range(N)] for _ in range(N)]

for i in range(M):
    uf_friend.union(AB[i][0]-1, AB[i][1]-1)
    es_friend[AB[i][0]-1][AB[i][1]-1] = True
    es_friend[AB[i][1]-1][AB[i][0]-1] = True
for i in range(K):
    es_block[CD[i][0]-1][CD[i][1]-1] = True
    es_block[CD[i][1]-1][CD[i][0]-1] = True

ans = [0 for _ in range(N)]
for root in uf_friend.roots():
    m = uf_friend.members(root)
    l = len(uf_friend.members(root))
    for i in range(l):
        for j in range(i+1, l):
            if es_friend[m[i]][m[j]] == es_block[m[i]][m[j]] == False:
                ans[m[i]] += 1
                ans[m[j]] += 1
print(" ".join(list(map(str, ans))))


Fixed submission:
N, M, K = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(M)]
CD = [list(map(int, input().split())) for _ in range(K)]

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_friend = UnionFind(N)
uf_block = UnionFind(N)

es_friend = [0 for _ in range(N)]
es_block = [0 for _ in range(N)]

for i in range(M):
    uf_friend.union(AB[i][0]-1, AB[i][1]-1)
    es_friend[AB[i][0]-1] += 1
    es_friend[AB[i][1]-1] += 1
for i in range(K):
    uf_block.union(CD[i][0]-1, CD[i][1]-1)
for i in range(K):
    if uf_friend.same(CD[i][0]-1, CD[i][1]-1):
        es_block[CD[i][0]-1] += 1
        es_block[CD[i][1]-1] += 1


ans = [0 for _ in range(N)]
for i in range(N):
    ans[i] = uf_friend.size(i) - es_friend[i] - es_block[i] - 1

print(" ".join(list(map(str, ans))))

Buggy python submission (verdict: Time Limit Exceeded):
N, M, K = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(M)]
CD = [list(map(int, input().split())) for _ in range(K)]

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_friend = UnionFind(N)
# uf_block = UnionFind(N)

es_friend = [[False for _ in range(N)] for _ in range(N)]
es_block = [[False for _ in range(N)] for _ in range(N)]

for i in range(M):
    uf_friend.union(AB[i][0]-1, AB[i][1]-1)
    es_friend[AB[i][0]-1][AB[i][1]-1] = True
    es_friend[AB[i][1]-1][AB[i][0]-1] = True
for i in range(K):
    # uf_block.union(CD[i][0]-1, CD[i][1]-1)
    es_block[CD[i][0]-1][CD[i][1]-1] = True
    es_block[CD[i][1]-1][CD[i][0]-1] = True

# print(es_friend)
# print(es_block)
# for i in range(N):
#     print(uf_friend.members(i), uf_block.members(i))


ans = [0 for _ in range(N)]
for i in range(N):
    for j in range(i+1, N):
        if (es_friend[i][j] == es_block[i][j] == False) and uf_friend.same(i, j):
            ans[i] += 1
            ans[j] += 1
print(" ".join(list(map(str, ans))))


Fixed submission:
N, M, K = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(M)]
CD = [list(map(int, input().split())) for _ in range(K)]

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_friend = UnionFind(N)
uf_block = UnionFind(N)

es_friend = [0 for _ in range(N)]
es_block = [0 for _ in range(N)]

for i in range(M):
    uf_friend.union(AB[i][0]-1, AB[i][1]-1)
    es_friend[AB[i][0]-1] += 1
    es_friend[AB[i][1]-1] += 1
for i in range(K):
    uf_block.union(CD[i][0]-1, CD[i][1]-1)
for i in range(K):
    if uf_friend.same(CD[i][0]-1, CD[i][1]-1):
        es_block[CD[i][0]-1] += 1
        es_block[CD[i][1]-1] += 1


ans = [0 for _ in range(N)]
for i in range(N):
    ans[i] = uf_friend.size(i) - es_friend[i] - es_block[i] - 1

print(" ".join(list(map(str, ans))))