Buggy python submission (verdict: Time Limit Exceeded):
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())


class UnionFindLabel(UnionFind):
    def __init__(self, labels):
        assert len(labels) == len(set(labels))
        
        self.n = len(labels)
        self.parents = [-1] * self.n
        self.d = {x: i for i, x in enumerate(labels)}
        self.d_inv = {i: x for i, x in enumerate(labels)}
    
    def find_label(self, x):
        return self.d_inv[super().find(self.d[x])]
    
    def union(self, x, y):
        super().union(self.d[x], self.d[y])
    
    def size(self, x):
        return super().size(self.d[x])
    
    def same(self, x, y):
        return super().same(self.d[x], self.d[y])
    
    def members(self, x):
        root = self.find(self.d[x])
        return [self.d_inv[i] for i in range(self.n) if self.find(i) == root]
    
    def roots(self):
        return [self.d_inv[i] for i, x in enumerate(self.parents) if x < 0]
def main():
    N, M, K = map(int, input().split())
    fd = defaultdict(list)
    uf = UnionFind(N+1)
    for _ in range(M):
        a, b = map(int, input().split())
        if a in fd:
            fd[a].append(b)
        else:
            fd[a] = [b]
        if b in fd:
            fd[b].append(a)
        else:
            fd[b] = [a]
        uf.union(a,b)
    for _ in range(K):
        c, d = map(int, input().split())
        if uf.same(c, d):
            fd[c].append(d)
            fd[d].append(c)
    r = []
    for i in range(1, N+1):
        r.append(len(uf.members(i))-len(fd[i])-1)
    print(' '.join(str(i) for i in r))
main()


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

def main():
    N, M, K = map(int, input().split())
    fd = defaultdict(list)
    uf = UnionFind(N+1)
    for _ in range(M):
        a, b = map(int, input().split())
        if a in fd:
            fd[a].append(b)
        else:
            fd[a] = [b]
        if b in fd:
            fd[b].append(a)
        else:
            fd[b] = [a]
        uf.union(a,b)
    for _ in range(K):
        c, d = map(int, input().split())
        if uf.same(c, d):
            fd[c].append(d)
            fd[d].append(c)
    r = []
    for i in range(1, N+1):
        r.append(uf.size(i)-len(fd[i])-1)
    print(' '.join(str(i) for i in r))
main()

Buggy python submission (verdict: Time Limit Exceeded):
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())


class UnionFindLabel(UnionFind):
    def __init__(self, labels):
        assert len(labels) == len(set(labels))
        
        self.n = len(labels)
        self.parents = [-1] * self.n
        self.d = {x: i for i, x in enumerate(labels)}
        self.d_inv = {i: x for i, x in enumerate(labels)}
    
    def find_label(self, x):
        return self.d_inv[super().find(self.d[x])]
    
    def union(self, x, y):
        super().union(self.d[x], self.d[y])
    
    def size(self, x):
        return super().size(self.d[x])
    
    def same(self, x, y):
        return super().same(self.d[x], self.d[y])
    
    def members(self, x):
        root = self.find(self.d[x])
        return [self.d_inv[i] for i in range(self.n) if self.find(i) == root]
    
    def roots(self):
        return [self.d_inv[i] for i, x in enumerate(self.parents) if x < 0]
def main():
    N, M, K = map(int, input().split())
    fd = defaultdict(list)
    uf = UnionFind(N+1)
    for _ in range(M):
        a, b = map(int, input().split())
        if a in fd:
            fd[a].append(b)
        else:
            fd[a] = [b]
        if b in fd:
            fd[b].append(a)
        else:
            fd[b] = [a]
        uf.union(a,b)
    for _ in range(K):
        c, d = map(int, input().split())
        if uf.same(c, d):
            fd[c].append(d)
            fd[d].append(c)
    r = []
    for i in range(1, N+1):
        r.append(len(uf.members(i))-len(fd[i])-1)
    print(' '.join(str(i) for i in r))
main()


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

def main():
    N, M, K = map(int, input().split())
    fd = defaultdict(list)
    uf = UnionFind(N+1)
    for _ in range(M):
        a, b = map(int, input().split())
        if a in fd:
            fd[a].append(b)
        else:
            fd[a] = [b]
        if b in fd:
            fd[b].append(a)
        else:
            fd[b] = [a]
        uf.union(a,b)
    for _ in range(K):
        c, d = map(int, input().split())
        if uf.same(c, d):
            fd[c].append(d)
            fd[d].append(c)
    r = []
    for i in range(1, N+1):
        r.append(uf.size(i)-len(fd[i])-1)
    print(' '.join(str(i) for i in r))
main()