# Original solution
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())
        
n,m = list(map(int,input().split()))
abl = []
for _ in range(m):
    a,b = list(map(int,input().split()))
    abl.append((a,b))
    
uf = UnionFind(n)

ansl = [0]
for a,b in abl[::-1]:
    point = 0
    uf.union(a-1, b-1)
    for i in list(uf.all_group_members().values()):
        point += len(i) * (len(i) - 1) // 2
    ansl.append(point)

for i in range(m):
    print((ansl[-1] - ansl[m-i-1]))
    
    
    
    
    
    

# Optimized solution
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())
        
n,m = list(map(int,input().split()))
abl = []
for _ in range(m):
    a,b = list(map(int,input().split()))
    abl.append((a,b))
    
uf = UnionFind(n)

ansl = [0]
point = 0
for a,b in abl[::-1]:
    if uf.same(a-1, b-1) == False:
        before_size1 = uf.size(a-1)
        before_size2 = uf.size(b-1)
        uf.union(a-1, b-1)
        new_size = uf.size(a-1)
        point += (new_size * (new_size - 1) // 2) - (before_size1 * (before_size1 - 1) // 2) - (before_size2 * (before_size2 - 1) // 2)
    ansl.append(point)

for i in range(m):
    print((ansl[-1] - ansl[m-i-1]))