# 解説を参考に作成
"""
D - Decayed Bridges
"""


class UnionFind():
    # 下記から拝借
    # https://note.nkmk.me/python-union-find/
    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())


# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
# 
# 
# @stop_watch
def solve(N, M, AB):
    AB = AB[::-1]
    AB = [[ab[0] - 1, ab[1] - 1] for ab in AB]
    un = UnionFind(N)
    ans = [N * (N - 1) // 2]
    for a, b in AB:
        if un.same(a, b):
            ans.append(ans[-1])
            continue
        ans.append(ans[-1] - (un.size(a) * un.size(b)))
        un.union(a, b)
    ans.reverse()
    for a in ans[1:]:
        print(a)


if __name__ == '__main__':
    N, M = map(int, input().split())
    AB = [[int(i) for i in input().split()] for _ in range(M)]
    solve(N, M, AB)

    # # test
    # from random import randint
    # from func import random_str
    # solve() """
D - Decayed Bridges
""" class UnionFind():
    # 下記から拝借
    # https://note.nkmk.me/python-union-find/
    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())


# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
# 
# 
# @stop_watch UnionFind def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

     __init__ self.n = n self.n self n n self.parents = [-1] * n self.parents self parents [-1] * n [-1] -1 n self self n 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]

     find if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

     self.parents[x] < 0 self.parents[x] self.parents self parents x 0 return x x self.parents[x] = self.find(self.parents[x]) self.parents[x] self.parents self parents x self.find(self.parents[x]) self.find self find self.parents[x] self.parents self parents x return self.parents[x] self.parents[x] self.parents self parents x self self x 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

     union x = self.find(x) x self.find(x) self.find self find x y = self.find(y) y self.find(y) self.find self find y if x == y:
            return

         x == y x y return if self.parents[x] > self.parents[y]:
            x, y = y, x

         self.parents[x] > self.parents[y] self.parents[x] self.parents self parents x self.parents[y] self.parents self parents y x, y = y, x x y y x self.parents[x] += self.parents[y] self.parents[x] self.parents self parents x self.parents[y] self.parents self parents y self.parents[y] = x self.parents[y] self.parents self parents y x self self x x y y def size(self, x):
        return -self.parents[self.find(x)]

     size return -self.parents[self.find(x)] -self.parents[self.find(x)] self.parents[self.find(x)] self.parents self parents self.find(x) self.find self find x self self x x def same(self, x, y):
        return self.find(x) == self.find(y)

     same return self.find(x) == self.find(y) self.find(x) == self.find(y) self.find(x) self.find self find x self.find(y) self.find self find y self self x x y y def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

     members root = self.find(x) root self.find(x) self.find self find x i for i in range(self.n) if self.find(i) == root for i in range(self.n) if self.find(i) == root i range(self.n) range self.n self n self.find(i) == root self.find(i) self.find self find i root if self.find(i) == root i return [i for i in range(self.n) if self.find(i) == root] [i for i in range(self.n) if self.find(i) == root] self self x x def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

     roots i for i, x in enumerate(self.parents) if x < 0 for i, x in enumerate(self.parents) if x < 0 i x enumerate(self.parents) enumerate self.parents self parents x < 0 x 0 if x < 0 i return [i for i, x in enumerate(self.parents) if x < 0] [i for i, x in enumerate(self.parents) if x < 0] self self def group_count(self):
        return len(self.roots())

     group_count return len(self.roots()) len(self.roots()) len self.roots() self.roots self roots self self def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

     all_group_members r: self.members(r) for r in self.roots() for r in self.roots() r self.roots() self.roots self roots for r in self.roots() r self.members(r) self.members self members r return {r: self.members(r) for r in self.roots()} {r: self.members(r) for r in self.roots()} self self def __str__(self):
        return '\n'.join(
            '{}: {}'.format(r, self.members(r)) for r in self.roots())


# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
# 
# 
# @stop_watch __str__ return '\n'.join(
            '{}: {}'.format(r, self.members(r)) for r in self.roots()) '\n'.join(
            '{}: {}'.format(r, self.members(r)) for r in self.roots()) '\n'.join '\n' join '{}: {}'.format(r, self.members(r)) '{}: {}'.format '{}: {}' format r self.members(r) self.members self members r self self def solve(N, M, AB):
    AB = AB[::-1]
    AB = [[ab[0] - 1, ab[1] - 1] for ab in AB]
    un = UnionFind(N)
    ans = [N * (N - 1) // 2]
    for a, b in AB:
        if un.same(a, b):
            ans.append(ans[-1])
            continue
        ans.append(ans[-1] - (un.size(a) * un.size(b)))
        un.union(a, b)
    ans.reverse()
    for a in ans[1:]:
        print(a) solve AB = AB[::-1] AB AB[::-1] AB ::-1 -1 [ab[0] - 1, ab[1] - 1] for ab in AB for ab in AB ab AB for ab in AB [ab[0] - 1, ab[1] - 1] ab[0] - 1 ab[0] ab 0 1 ab[1] - 1 ab[1] ab 1 1 AB = [[ab[0] - 1, ab[1] - 1] for ab in AB] AB [[ab[0] - 1, ab[1] - 1] for ab in AB] un = UnionFind(N) un UnionFind(N) UnionFind N ans = [N * (N - 1) // 2] ans [N * (N - 1) // 2] N * (N - 1) // 2 N * (N - 1) N N - 1 N 1 2 for a, b in AB:
        if un.same(a, b):
            ans.append(ans[-1])
            continue
        ans.append(ans[-1] - (un.size(a) * un.size(b)))
        un.union(a, b)
     a b AB if un.same(a, b):
            ans.append(ans[-1])
            continue
         un.same(a, b) un.same un same a b ans.append(ans[-1]) ans.append ans append ans[-1] ans -1 continue ans.append(ans[-1] - (un.size(a) * un.size(b))) ans.append ans append ans[-1] - (un.size(a) * un.size(b)) ans[-1] ans -1 un.size(a) * un.size(b) un.size(a) un.size un size a un.size(b) un.size un size b un.union(a, b) un.union un union a b ans.reverse() ans.reverse ans reverse for a in ans[1:]:
        print(a) a ans[1:] ans 1: 1 print(a) print a N N M M AB AB if __name__ == '__main__':
    N, M = map(int, input().split())
    AB = [[int(i) for i in input().split()] for _ in range(M)]
    solve(N, M, AB)

    # # test
    # from random import randint
    # from func import random_str
    # solve() __name__ == '__main__' __name__ '__main__' N, M = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split M [int(i) for i in input().split()] for _ in range(M) for _ in range(M) _ range(M) range M for _ in range(M) [int(i) for i in input().split()] AB = [[int(i) for i in input().split()] for _ in range(M)] AB [[int(i) for i in input().split()] for _ in range(M)] solve(N, M, AB) solve N M AB class UnionFind():
    # 下記から拝借
    # https://note.nkmk.me/python-union-find/
    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())


# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
# 
# 
# @stop_watch class UnionFind():
    # 下記から拝借
    # https://note.nkmk.me/python-union-find/
    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())


# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
# 
# 
# @stop_watch UnionFind def solve(N, M, AB):
    AB = AB[::-1]
    AB = [[ab[0] - 1, ab[1] - 1] for ab in AB]
    un = UnionFind(N)
    ans = [N * (N - 1) // 2]
    for a, b in AB:
        if un.same(a, b):
            ans.append(ans[-1])
            continue
        ans.append(ans[-1] - (un.size(a) * un.size(b)))
        un.union(a, b)
    ans.reverse()
    for a in ans[1:]:
        print(a) def solve(N, M, AB):
    AB = AB[::-1]
    AB = [[ab[0] - 1, ab[1] - 1] for ab in AB]
    un = UnionFind(N)
    ans = [N * (N - 1) // 2]
    for a, b in AB:
        if un.same(a, b):
            ans.append(ans[-1])
            continue
        ans.append(ans[-1] - (un.size(a) * un.size(b)))
        un.union(a, b)
    ans.reverse()
    for a in ans[1:]:
        print(a) solve M = map(int, input().split()) map(int, input().split()) M AB = [[int(i) for i in input().split()] for _ in range(M)] [[int(i) for i in input().split()] for _ in range(M)] AB N, M = map(int, input().split()) map(int, input().split()) N
# 解説を参考に作成
"""
D - Decayed Bridges
"""


class UnionFind():
    # 下記から拝借
    # https://note.nkmk.me/python-union-find/
    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())


# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
# 
# 
# @stop_watch
def solve(N, M, AB):
    AB = AB[::-1]
    AB = [[ab[0] - 1, ab[1] - 1] for ab in AB]
    un = UnionFind(N)
    ans = [N * (N - 1) // 2]
    for a, b in AB:
        if un.same(a, b):
            ans.append(ans[-1])
            continue
        ans.append(ans[-1] - (un.size(a) * un.size(b)))
        un.union(a, b)
    ans.reverse()
    for a in ans[1:]:
        print(a)


if __name__ == '__main__':
    N, M = map(int, input().split())
    AB = [[int(i) for i in input().split()] for _ in range(M)]
    solve(N, M, AB)

    # # test
    # from random import randint
    # from func import random_str
    # solve()
