Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline
class UnionFind():
    def __init__(self, n):
        self.n = n+1
        self.parents = [-1] * (n+1)

    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, input().split()))
friend = [set() for i in range(n+1)]
tree = UnionFind(n)
for i in range(m):
    a, b = map(int, input().split())
    friend[a].add(b)
    friend[b].add(a)
    tree.union(a, b)

for i in range(k):
    c, d = map(int, input().split())
    friend[c].add(d)
    friend[d].add(c)

ans = [0]*(n+1)
for group in tree.all_group_members().values():
    group = set(group)
    for elem in group:
        ans[elem] = len(group - friend[elem])-1

print(" ".join(map(str, ans[1:])))


Fixed submission:
import sys
input = sys.stdin.readline
class UnionFind():
    def __init__(self, n):
        self.n = n+1
        self.parents = [-1] * (n+1)

    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, input().split()))
friend = [0]*(n+1)
tree = UnionFind(n)
for i in range(m):
    a, b = map(int, input().split())
    friend[a] += 1
    friend[b] += 1
    tree.union(a, b)

ans = [0]*(n+1)
for i in range(1, n+1):
    ans[i] = tree.size(i) - friend[i] - 1

for i in range(k):
    c, d = map(int, input().split())
    if tree.same(c, d):
        ans[c] -= 1
        ans[d] -= 1


print(" ".join(map(str, ans[1:])))

Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline
class Union_Find():
    def __init__(self, num):
        self.par = [-1]*(num+1)
        self.siz = [1]*(num+1)

    def same_checker(self, x, y):
        return self.find(x) == self.find(y)

    def find(self, x):
        if self.par[x] < 0:
            return x
        else:
            x = self.par[x]
            return self.find(x)

    def union(self, x, y):
        rx = self.find(x)
        ry = self.find(y)
        if rx != ry:
            if self.par[rx] < self.par[ry]:
                self.par[ry] = rx
                self.siz[rx] += self.siz[ry]
            elif self.par[rx] > self.par[ry]:
                self.par[rx] = ry
                self.siz[ry] += self.siz[rx]
            else:
                self.par[rx] -= 1
                self.par[ry] = rx
                self.siz[rx] += self.siz[ry]
        return

    def size(self, x):
        return self.siz[self.find(x)]

n, m, k = list(map(int, input().split()))
friend = [set() for i in range(n+1)]
block = [set() for i in range(n+1)]
tree = Union_Find(n)
for i in range(m):
    a, b = map(int, input().split())
    friend[a].add(b)
    friend[b].add(a)
    tree.union(a, b)

for i in range(k):
    c, d = map(int, input().split())
    block[c].add(d)
    block[d].add(c)

ans = []
for i in range(1, n+1):
    tree.find(i)

friend_list = [set() for i in range(n+1)]
tree_find = [tree.find(i) for i in range(1, n+1)]
for i in range(1, n+1):
    friend_list[tree_find[i-1]].add(i)
for i in range(1, n+1):
    ans.append(len(friend_list[tree_find[i-1]] - friend[i] - block[i])-1)

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


Fixed submission:
import sys
input = sys.stdin.readline
class UnionFind():
    def __init__(self, n):
        self.n = n+1
        self.parents = [-1] * (n+1)

    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, input().split()))
friend = [0]*(n+1)
tree = UnionFind(n)
for i in range(m):
    a, b = map(int, input().split())
    friend[a] += 1
    friend[b] += 1
    tree.union(a, b)

ans = [0]*(n+1)
for i in range(1, n+1):
    ans[i] = tree.size(i) - friend[i] - 1

for i in range(k):
    c, d = map(int, input().split())
    if tree.same(c, d):
        ans[c] -= 1
        ans[d] -= 1


print(" ".join(map(str, ans[1:])))

Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline
class Union_Find():
    def __init__(self, num):
        self.par = [-1]*(num+1)
        self.siz = [1]*(num+1)

    def same_checker(self, x, y):
        return self.find(x) == self.find(y)

    def find(self, x):
        if self.par[x] < 0:
            return x
        else:
            x = self.par[x]
            return self.find(x)

    def union(self, x, y):
        rx = self.find(x)
        ry = self.find(y)
        if rx != ry:
            if self.par[rx] < self.par[ry]:
                self.par[ry] = rx
                self.siz[rx] += self.siz[ry]
            elif self.par[rx] > self.par[ry]:
                self.par[rx] = ry
                self.siz[ry] += self.siz[rx]
            else:
                self.par[rx] -= 1
                self.par[ry] = rx
                self.siz[rx] += self.siz[ry]
        return

    def size(self, x):
        return self.siz[self.find(x)]

n, m, k = list(map(int, input().split()))
friend = [set() for i in range(n+1)]
block = [set() for i in range(n+1)]
tree = Union_Find(n)
for i in range(m):
    a, b = map(int, input().split())
    friend[a].add(b)
    friend[b].add(a)
    tree.union(a, b)

for i in range(k):
    c, d = map(int, input().split())
    block[c].add(d)
    block[d].add(c)

ans = []
for i in range(1, n+1):
    tree.find(i)

friend_list = [set() for i in range(2*n+1)]
for i in range(1, n+1):
    friend_list[tree.find(i)].add(i)
for i in range(1, n+1):
    group = friend_list[tree.find(i)]
    group = group - friend[i] - block[i]
    ans.append(len(group)-1)
    
print(" ".join(map(str, ans)))


Fixed submission:
import sys
input = sys.stdin.readline
class UnionFind():
    def __init__(self, n):
        self.n = n+1
        self.parents = [-1] * (n+1)

    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, input().split()))
friend = [0]*(n+1)
tree = UnionFind(n)
for i in range(m):
    a, b = map(int, input().split())
    friend[a] += 1
    friend[b] += 1
    tree.union(a, b)

ans = [0]*(n+1)
for i in range(1, n+1):
    ans[i] = tree.size(i) - friend[i] - 1

for i in range(k):
    c, d = map(int, input().split())
    if tree.same(c, d):
        ans[c] -= 1
        ans[d] -= 1


print(" ".join(map(str, ans[1:])))