#template
def inputlist(): return [int(k) for k in input().split()]
#template
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 all_group_members(self):
        return {r: self.members(r) for r in self.roots()}


N,M = inputlist()
li = [0]*M
for i in range(M):
    A,B = inputlist()
    A-=1
    B-=1
    li[i] = [A,B]
ans = [N*(N-1)//2]
uf = UnionFind(N)
for i in range(M-1,-1,-1):
    A,B = li[i][0],li[i][1]
    if uf.same(A,B):
        ans.append(ans[-1])
        continue
    tmp = ans[-1]-uf.size(A)*uf.size(B)
    ans.append(tmp)
    uf.union(A,B)
for i in range(M-1,-1,-1):
    print(ans[i]) int(k) for k in input().split() for k in input().split() k input().split() ().split () input split for k in input().split() int(k) int k def inputlist(): return [int(k) for k in input().split()]
#template inputlist 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 all_group_members(self):
        return {r: self.members(r) for r in self.roots()} 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 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 N,M = inputlist() N inputlist() inputlist M li = [0]*M li [0]*M [0] 0 M for i in range(M):
    A,B = inputlist()
    A-=1
    B-=1
    li[i] = [A,B] i range(M) range M A,B = inputlist() A inputlist() inputlist B A-=1 A 1 B-=1 B 1 li[i] = [A,B] li[i] li i [A,B] A B ans = [N*(N-1)//2] ans [N*(N-1)//2] N*(N-1)//2 N*(N-1) N N-1 N 1 2 uf = UnionFind(N) uf UnionFind(N) UnionFind N for i in range(M-1,-1,-1):
    A,B = li[i][0],li[i][1]
    if uf.same(A,B):
        ans.append(ans[-1])
        continue
    tmp = ans[-1]-uf.size(A)*uf.size(B)
    ans.append(tmp)
    uf.union(A,B) i range(M-1,-1,-1) range M-1 M 1 -1 -1 A,B = li[i][0],li[i][1] A li[i][0] [i] li i 0 B li[i][1] [i] li i 1 if uf.same(A,B):
        ans.append(ans[-1])
        continue
     uf.same(A,B) uf.same uf same A B ans.append(ans[-1]) ans.append ans append ans[-1] ans -1 continue tmp = ans[-1]-uf.size(A)*uf.size(B) tmp ans[-1]-uf.size(A)*uf.size(B) ans[-1] ans -1 uf.size(A)*uf.size(B) uf.size(A) uf.size uf size A uf.size(B) uf.size uf size B ans.append(tmp) ans.append ans append tmp uf.union(A,B) uf.union uf union A B for i in range(M-1,-1,-1):
    print(ans[i]) i range(M-1,-1,-1) range M-1 M 1 -1 -1 print(ans[i]) print ans[i] ans i 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 all_group_members(self):
        return {r: self.members(r) for r in self.roots()} 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 all_group_members(self):
        return {r: self.members(r) for r in self.roots()} UnionFind A,B = inputlist() inputlist() A B = li[i][0],li[i][1] li[i][1] B uf = UnionFind(N) UnionFind(N) uf N,M = inputlist() inputlist() N A-=1 1 A def inputlist(): return [int(k) for k in input().split()]
#template def inputlist(): return [int(k) for k in input().split()]
#template inputlist li = [0]*M [0]*M li M = inputlist() inputlist() M B-=1 1 B A,B = li[i][0],li[i][1] li[i][0] A ans = [N*(N-1)//2] [N*(N-1)//2] ans tmp = ans[-1]-uf.size(A)*uf.size(B) ans[-1]-uf.size(A)*uf.size(B) tmp B = inputlist() inputlist() B
#template
def inputlist(): return [int(k) for k in input().split()]
#template
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 all_group_members(self):
        return {r: self.members(r) for r in self.roots()}


N,M = inputlist()
li = [0]*M
for i in range(M):
    A,B = inputlist()
    A-=1
    B-=1
    li[i] = [A,B]
ans = [N*(N-1)//2]
uf = UnionFind(N)
for i in range(M-1,-1,-1):
    A,B = li[i][0],li[i][1]
    if uf.same(A,B):
        ans.append(ans[-1])
        continue
    tmp = ans[-1]-uf.size(A)*uf.size(B)
    ans.append(tmp)
    uf.union(A,B)
for i in range(M-1,-1,-1):
    print(ans[i])