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



N, M = list(map(int, input().split()))

uf = UnionFind(N)



ABlist = [list(map(int, input().split())) for _ in range(M)]

ans = [0] * M

for i in reversed(list(range(M))):

    A, B = ABlist[i]

    if not uf.same(A-1, B-1):

        ans[i] = uf.size(A-1)*uf.size(B-1)

        uf.union(A-1, B-1)

num = 0

for a in ans:

    num += a

    print(num)

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



import sys

input = sys.stdin.readline



N, M = list(map(int, input().split()))

uf = UnionFind(N)

ans = [N*(N-1)//2]

ABlist = [tuple(map(int, input().split())) for _ in range(M)]

for a, b in reversed(ABlist[1::]):

    if uf.same(a-1, b-1):

        ans.append(ans[-1])

    else:

        ans.append(ans[-1] - uf.size(a-1)*uf.size(b-1))

    uf.union(a-1, b-1)



for a in ans[::-1]:

    print(a)

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


N, M = list(map(int, input().split()))
uf = UnionFind(N)
ABlist = [list(map(int, input().split())) for _ in range(M)]
ans = [0] * M
for i in reversed(list(range(M))):
    A, B = ABlist[i]
    if not uf.same(A - 1, B - 1):
        ans[i] = uf.size(A - 1) * uf.size(B - 1)
        uf.union(A - 1, B - 1)
num = 0
for a in ans:
    num += a
    print(num)

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


import sys

input = sys.stdin.readline
N, M = list(map(int, input().split()))
uf = UnionFind(N)
ans = [N * (N - 1) // 2]
ABlist = [tuple(map(int, input().split())) for _ in range(M)]
for a, b in reversed(ABlist[1::]):
    if uf.same(a - 1, b - 1):
        ans.append(ans[-1])
    else:
        ans.append(ans[-1] - uf.size(a - 1) * uf.size(b - 1))
    uf.union(a - 1, b - 1)
for a in ans[::-1]:
    print(a)

+import sys + +input = sys.stdin.readline -ABlist = [list(map(int, input().split())) for _ in range(M)] -ans = [0] * M -for i in reversed(list(range(M))): -    A, B = ABlist[i] -    if not uf.same(A - 1, B - 1): -        ans[i] = uf.size(A - 1) * uf.size(B - 1) -        uf.union(A - 1, B - 1) -num = 0 -for a in ans: -    num += a -    print(num) +ans = [N * (N - 1) // 2] +ABlist = [tuple(map(int, input().split())) for _ in range(M)] +for a, b in reversed(ABlist[1::]): +    if uf.same(a - 1, b - 1): +        ans.append(ans[-1]) +    else: +        ans.append(ans[-1] - uf.size(a - 1) * uf.size(b - 1)) +    uf.union(a - 1, b - 1) +for a in ans[::-1]: +    print(a)