# 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()))
uf = UnionFind(n)
bridges = []
for i in range(m):
    ai,bi = list(map(int,input().split()))
    bridges.append((ai,bi))
bridges = bridges[::-1]
answers = []
for i in range(m):
    ans = 1
    for j in uf.roots():
        x = uf.size(j)
        ans += x*(n-x)
    ans //= 2
    answers.append(ans)
    uf.union(bridges[i][0]-1,bridges[i][1]-1)
answers = answers[::-1]
for i in range(m):
    print((answers[i]))

# 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()))
uf = UnionFind(n)
bridges = []
for i in range(m):
    ai,bi = list(map(int,input().split()))
    bridges.append((ai,bi))
bridges = bridges[::-1]
ans = n*(n-1)//2
answers = [ans]
for i in range(m):
    x,y = bridges[i][0]-1,bridges[i][1]-1
    if not uf.same(x,y):
        ans -= uf.size(x) * uf.size(y)
    answers.append(ans)
    uf.union(x,y)
answers = answers[::-1]
for i in range(1,m+1):
    print((answers[i]))