import sys
read = sys.stdin.buffer.read
input = sys.stdin.readline
input = sys.stdin.buffer.readline


#sys.setrecursionlimit(10**9)
#from functools import lru_cache

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')

#2320
#import numpy as np

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



def main():
	n,m=MI()
	e=[]
	for _ in range(m):
		a,b=MI()
		a-=1
		b-=1
		e.append([a,b])
	#print(e)

	UF=UnionFind(n)
	ans=[]
	tmp=n*(n-1)//2

	for li in reversed(e):
		ans.append(tmp)
		a=li[0]
		b=li[1]
		if UF.same(a,b):
			continue
		aa=UF.parents[UF.find(a)]
		bb=UF.parents[UF.find(b)]
		#print(a,b,aa,bb)
		tmp-=aa*bb
		UF.union(a,b)
	print("\n".join(str(i) for i in ans[::-1]))




if __name__ == "__main__":
	main() import sys sys read = sys.stdin.buffer.read read sys.stdin.buffer.read sys.stdin.buffer sys.stdin sys stdin buffer read input = sys.stdin.readline input sys.stdin.readline sys.stdin sys stdin readline input = sys.stdin.buffer.readline input sys.stdin.buffer.readline sys.stdin.buffer sys.stdin sys stdin buffer readline def RD(): return sys.stdin.read() RD def II(): return int(input()) II def MI(): return map(int,input().split()) MI def MF(): return map(float,input().split()) MF def LI(): return list(map(int,input().split())) LI def LF(): return list(map(float,input().split())) LF def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')

#2320
#import numpy as np TI 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()) 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()) __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 main():
	n,m=MI()
	e=[]
	for _ in range(m):
		a,b=MI()
		a-=1
		b-=1
		e.append([a,b])
	#print(e)

	UF=UnionFind(n)
	ans=[]
	tmp=n*(n-1)//2

	for li in reversed(e):
		ans.append(tmp)
		a=li[0]
		b=li[1]
		if UF.same(a,b):
			continue
		aa=UF.parents[UF.find(a)]
		bb=UF.parents[UF.find(b)]
		#print(a,b,aa,bb)
		tmp-=aa*bb
		UF.union(a,b)
	print("\n".join(str(i) for i in ans[::-1])) main n,m=MI() n MI() MI m e=[] e [] for _ in range(m):
		a,b=MI()
		a-=1
		b-=1
		e.append([a,b])
	#print(e)

	 _ range(m) range m a,b=MI() a MI() MI b a-=1 a 1 b-=1 b 1 e.append([a,b]) e.append e append [a,b] a b UF=UnionFind(n) UF UnionFind(n) UnionFind n ans=[] ans [] tmp=n*(n-1)//2 tmp n*(n-1)//2 n*(n-1) n n-1 n 1 2 for li in reversed(e):
		ans.append(tmp)
		a=li[0]
		b=li[1]
		if UF.same(a,b):
			continue
		aa=UF.parents[UF.find(a)]
		bb=UF.parents[UF.find(b)]
		#print(a,b,aa,bb)
		tmp-=aa*bb
		UF.union(a,b)
	 li reversed(e) reversed e ans.append(tmp) ans.append ans append tmp a=li[0] a li[0] li 0 b=li[1] b li[1] li 1 if UF.same(a,b):
			continue
		 UF.same(a,b) UF.same UF same a b continue aa=UF.parents[UF.find(a)] aa UF.parents[UF.find(a)] UF.parents UF parents UF.find(a) UF.find UF find a bb=UF.parents[UF.find(b)] bb UF.parents[UF.find(b)] UF.parents UF parents UF.find(b) UF.find UF find b tmp-=aa*bb tmp aa*bb aa bb UF.union(a,b) UF.union UF union a b print("\n".join(str(i) for i in ans[::-1])) print "\n".join(str(i) for i in ans[::-1]) "\n".join "\n" join str(i) str i if __name__ == "__main__":
	main() __name__ == "__main__" __name__ "__main__" main() main def RD(): return sys.stdin.read() def RD(): return sys.stdin.read() RD def MF(): return map(float,input().split()) def MF(): return map(float,input().split()) MF def LI(): return list(map(int,input().split())) def LI(): return list(map(int,input().split())) LI 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()) 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()) UnionFind def II(): return int(input()) def II(): return int(input()) II def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')

#2320
#import numpy as np def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')

#2320
#import numpy as np TI input = sys.stdin.readline sys.stdin.readline input input = sys.stdin.buffer.readline sys.stdin.buffer.readline input def main():
	n,m=MI()
	e=[]
	for _ in range(m):
		a,b=MI()
		a-=1
		b-=1
		e.append([a,b])
	#print(e)

	UF=UnionFind(n)
	ans=[]
	tmp=n*(n-1)//2

	for li in reversed(e):
		ans.append(tmp)
		a=li[0]
		b=li[1]
		if UF.same(a,b):
			continue
		aa=UF.parents[UF.find(a)]
		bb=UF.parents[UF.find(b)]
		#print(a,b,aa,bb)
		tmp-=aa*bb
		UF.union(a,b)
	print("\n".join(str(i) for i in ans[::-1])) def main():
	n,m=MI()
	e=[]
	for _ in range(m):
		a,b=MI()
		a-=1
		b-=1
		e.append([a,b])
	#print(e)

	UF=UnionFind(n)
	ans=[]
	tmp=n*(n-1)//2

	for li in reversed(e):
		ans.append(tmp)
		a=li[0]
		b=li[1]
		if UF.same(a,b):
			continue
		aa=UF.parents[UF.find(a)]
		bb=UF.parents[UF.find(b)]
		#print(a,b,aa,bb)
		tmp-=aa*bb
		UF.union(a,b)
	print("\n".join(str(i) for i in ans[::-1])) main read = sys.stdin.buffer.read sys.stdin.buffer.read read def LF(): return list(map(float,input().split())) def LF(): return list(map(float,input().split())) LF def MI(): return map(int,input().split()) def MI(): return map(int,input().split()) MI
import sys
read = sys.stdin.buffer.read
input = sys.stdin.readline
input = sys.stdin.buffer.readline


#sys.setrecursionlimit(10**9)
#from functools import lru_cache

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')

#2320
#import numpy as np

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



def main():
	n,m=MI()
	e=[]
	for _ in range(m):
		a,b=MI()
		a-=1
		b-=1
		e.append([a,b])
	#print(e)

	UF=UnionFind(n)
	ans=[]
	tmp=n*(n-1)//2

	for li in reversed(e):
		ans.append(tmp)
		a=li[0]
		b=li[1]
		if UF.same(a,b):
			continue
		aa=UF.parents[UF.find(a)]
		bb=UF.parents[UF.find(b)]
		#print(a,b,aa,bb)
		tmp-=aa*bb
		UF.union(a,b)
	print("\n".join(str(i) for i in ans[::-1]))




if __name__ == "__main__":
	main()