Buggy python submission (verdict: Time Limit Exceeded):
def check(a, b):
    global t
    global ans_list
    a_len = 1
    b_len = 1
    if len(t) == 0:
        t.append([a,b])
        ans_list.append(a_len*b_len)
    else:
        for i in range(len(t)):
            if a in t[i]:
                a_list = i
                a_len = len(t[i])
            if b in t[i]:
                b_list = i
                b_len = len(t[i])
        if a_len == 1 and b_len == 1:
            t.append([a,b])
            ans_list.append(1)
        elif a_len == 1 and b_len != 1:
            t[b_list].append(a)
            ans_list.append(a_len*b_len)
        elif a_len != 1 and b_len == 1:
            t[a_list].append(b)
            ans_list.append(a_len*b_len)
        elif a_len != 1 and b_len != 1:
            if a_list != b_list:
                if a_list > b_list:
                    tem = t.pop(a_list)
                    t[b_list] += tem
                else:
                    tem = t.pop(b_list)
                    t[a_list] += tem
                ans_list.append(a_len*b_len)
            elif a_list == b_list:
                ans_list.append(0)

    return 0




n,m = [int(_) for _ in input().split()]
l = []
for i in range(m):
    l.append([int(_) for _ in input().split()])
l.reverse()

ans_list = []
t = []
for i in range(m):
    a,b = l[i]
    check(a, b)
ans_list.reverse()
s = [0] * m
s[0] = ans_list[0]
for i in range(1, len(ans_list)):
    s[i] = s[i-1] + ans_list[i]
for i in range(len(s)):
    print(s[i])

Fixed submission:
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 check(a, b):
    global uf
    global ans_list
    if uf.same(a,b):
        ans_list.append(0)
    else:
        ans_list.append(uf.size(a)*uf.size(b))
        uf.union(a,b)
    return 0




n,m = [int(_) for _ in input().split()]
l = []
for i in range(m):
    l.append([int(_) for _ in input().split()])
l.reverse()

ans_list = []
uf = UnionFind(n+1)
for i in range(m):
    a,b = l[i]
    check(a, b)
ans_list.reverse()
s = [0] * m
s[0] = ans_list[0]
for i in range(1, len(ans_list)):
    s[i] = s[i-1] + ans_list[i]
for i in range(len(s)):
    print(s[i])

Buggy python submission (verdict: Time Limit Exceeded):
def check(a, b):
    global t
    global ans_list
    a_len = 1
    b_len = 1
    if len(t) == 0:
        t.append([a,b])
        ans_list.append(a_len*b_len)
    else:
        for i in range(len(t)):
            if a in t[i]:
                a_list = i
                a_len = len(t[i])
            if b in t[i]:
                b_list = i
                b_len = len(t[i])
        if a_len == 1 and b_len == 1:
            t.append([a,b])
            ans_list.append(1)
        elif a_len == 1 and b_len != 1:
            t[b_list].append(a)
            ans_list.append(a_len*b_len)
        elif a_len != 1 and b_len == 1:
            t[a_list].append(b)
            ans_list.append(a_len*b_len)
        elif a_len != 1 and b_len != 1:
            if a_list != b_list:
                if a_list > b_list:
                    tem = t.pop(a_list)
                    t[b_list] += tem
                else:
                    tem = t.pop(b_list)
                    t[a_list] += tem
                ans_list.append(a_len*b_len)
            elif a_list == b_list:
                ans_list.append(0)

    return 0




n,m = [int(_) for _ in input().split()]
l = []
for i in range(m):
    l.append([int(_) for _ in input().split()])
l.reverse()

ans_list = []
t = []
for i in range(m):
    a,b = l[i]
    check(a, b)
ans_list.reverse()
s = [0] * m
s[0] = ans_list[0]
for i in range(1, len(ans_list)):
    s[i] = s[i-1] + ans_list[i]
for i in range(len(s)):
    print(s[i])

Fixed submission:
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 check(a, b):
    global uf
    global ans_list
    if uf.same(a,b):
        ans_list.append(0)
    else:
        ans_list.append(uf.size(a)*uf.size(b))
        uf.union(a,b)
    return 0




n,m = [int(_) for _ in input().split()]
l = []
for i in range(m):
    l.append([int(_) for _ in input().split()])
l.reverse()

ans_list = []
uf = UnionFind(n+1)
for i in range(m):
    a,b = l[i]
    check(a, b)
ans_list.reverse()
s = [0] * m
s[0] = ans_list[0]
for i in range(1, len(ans_list)):
    s[i] = s[i-1] + ans_list[i]
for i in range(len(s)):
    print(s[i])

Buggy python submission (verdict: Time Limit Exceeded):
import sys


sys.setrecursionlimit(10 ** 9)

n,m = [int(_) for _ in input().split()]
l = [[] for _ in range(n+1)]
a = [0]*m
b = [0]*m
for i in range(m):
    a[i],b[i] = [int(_) for _ in input().split()]
    l[a[i]].append(b[i])
    l[b[i]].append(a[i])
seen = []

def dfs(l, todo):
    global seen
    global c
    if len(todo) != 0:
        s = todo.pop()
        for i in l[s]:
            if i not in seen:
                todo.append(i)
                seen.append(i)
                c += 1
            else:
                continue
        return dfs(l, todo)
    else:
        return 0


for j in range(m):
    l[a[j]].remove(b[j])
    l[b[j]].remove(a[j])
    ans = 0
    seen = []
    for i in range(1, n+1):
        if i not in seen:
            s = i
            seen.append(s)
            c = 1
            todo = [s]
            dfs(l, todo)
            ans += c * (n-c)
    print(ans//2)

Fixed submission:
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 check(a, b):
    global uf
    global ans_list
    if uf.same(a,b):
        ans_list.append(0)
    else:
        ans_list.append(uf.size(a)*uf.size(b))
        uf.union(a,b)
    return 0




n,m = [int(_) for _ in input().split()]
l = []
for i in range(m):
    l.append([int(_) for _ in input().split()])
l.reverse()

ans_list = []
uf = UnionFind(n+1)
for i in range(m):
    a,b = l[i]
    check(a, b)
ans_list.reverse()
s = [0] * m
s[0] = ans_list[0]
for i in range(1, len(ans_list)):
    s[i] = s[i-1] + ans_list[i]
for i in range(len(s)):
    print(s[i])

Buggy python submission (verdict: Time Limit Exceeded):
import sys


sys.setrecursionlimit(10 ** 9)

n,m = [int(_) for _ in input().split()]
l = [[] for _ in range(n+1)]
a = [0]*m
b = [0]*m
for i in range(m):
    a[i],b[i] = [int(_) for _ in input().split()]
    l[a[i]].append(b[i])
    l[b[i]].append(a[i])
seen = {}
for i in range(n+1):
    seen[i] = False

def dfs(l, todo):
    global seen
    global c
    if len(todo) != 0:
        s = todo.pop()
        for i in l[s]:
            if not seen[i]:
                todo.append(i)
                seen[i] = True
                c += 1
            else:
                continue
        return dfs(l, todo)
    else:
        return 0


for j in range(m):
    l[a[j]].remove(b[j])
    l[b[j]].remove(a[j])
    ans = 0
    for i in range(n+1):
        seen[i] = False
    for i in range(1, n+1):
        if not seen[i]:
            s = i
            seen[s] = True
            c = 1
            todo = [s]
            dfs(l, todo)
            ans += c * (n-c)
    print(ans//2)

Fixed submission:
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 check(a, b):
    global uf
    global ans_list
    if uf.same(a,b):
        ans_list.append(0)
    else:
        ans_list.append(uf.size(a)*uf.size(b))
        uf.union(a,b)
    return 0




n,m = [int(_) for _ in input().split()]
l = []
for i in range(m):
    l.append([int(_) for _ in input().split()])
l.reverse()

ans_list = []
uf = UnionFind(n+1)
for i in range(m):
    a,b = l[i]
    check(a, b)
ans_list.reverse()
s = [0] * m
s[0] = ans_list[0]
for i in range(1, len(ans_list)):
    s[i] = s[i-1] + ans_list[i]
for i in range(len(s)):
    print(s[i])

Buggy python submission (verdict: Time Limit Exceeded):
import sys


sys.setrecursionlimit(10 ** 9)

n,m = [int(_) for _ in input().split()]
l = [[] for _ in range(n+1)]
a = [0]*m
b = [0]*m
for i in range(m):
    a[i],b[i] = [int(_) for _ in input().split()]
    l[a[i]].append(b[i])
    l[b[i]].append(a[i])
seen = {}
for i in range(n+1):
    seen[i] = False

def dfs(l, todo):
    global seen
    global c
    if len(todo) != 0:
        s = todo.pop()
        for i in l[s]:
            if not seen[i]:
                todo.append(i)
                seen[i] = True
                c += 1
            else:
                continue
        return dfs(l, todo)
    else:
        return 0


for j in range(m):
    l[a[j]].remove(b[j])
    l[b[j]].remove(a[j])
    ans = 0
    for i in range(n+1):
        seen[i] = False
    for i in range(1, n+1):
        if not seen[i]:
            s = i
            seen[s] = True
            c = 1
            todo = [s]
            dfs(l, todo)
            ans += c * (n-c)
    print(ans//2)

Fixed submission:
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 check(a, b):
    global uf
    global ans_list
    if uf.same(a,b):
        ans_list.append(0)
    else:
        ans_list.append(uf.size(a)*uf.size(b))
        uf.union(a,b)
    return 0




n,m = [int(_) for _ in input().split()]
l = []
for i in range(m):
    l.append([int(_) for _ in input().split()])
l.reverse()

ans_list = []
uf = UnionFind(n+1)
for i in range(m):
    a,b = l[i]
    check(a, b)
ans_list.reverse()
s = [0] * m
s[0] = ans_list[0]
for i in range(1, len(ans_list)):
    s[i] = s[i-1] + ans_list[i]
for i in range(len(s)):
    print(s[i])