class UnionFind():
    #https://note.nkmk.me/python-union-find/ 
    #note.nkmk.me  2019-08-18 
    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())

# 初期入力
import sys
input = sys.stdin.readline  #文字列では使わない

N,M = map(int, input().split())
bridge =[]
for i in range(M):
    a,b = map(int, input().split())
    bridge.append((a,b))

all =N*(N-1)//2 #行き来できる島の組み合わせ
ans =[0]*(M-1) +[all]
#print(ans)

#i 番目の橋が崩落した直後の不便さ＝i+1番目がまだ残っているときの不便さ
#   ⇒最後の橋から順番に作り、できた時の不便さ
uf =UnionFind(N)

for i in range(M-1,0,-1):

    a,b =bridge[i]
    #事前につながっているかどうかで場合分け
    if uf.same(a-1,b-1):
        ans[i-1] =ans[i]
    #くっつけてから変化分を引く
    else:
        x_a =uf.size(a-1)
        x_b =uf.size(b-1)
        connection_bfo =x_a*(x_a -1)//2 +x_b*(x_b -1)//2
        connection_aft =(x_a +x_b) *(x_a +x_b -1)//2 
        ans[i-1] =ans[i] -connection_aft +connection_bfo
        uf.union(a-1,b-1)
[print(i) for i in ans] class UnionFind():
    #https://note.nkmk.me/python-union-find/ 
    #note.nkmk.me  2019-08-18 
    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 import sys sys input = sys.stdin.readline input sys.stdin.readline sys.stdin sys stdin readline N,M = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split M bridge =[] bridge [] for i in range(M):
    a,b = map(int, input().split())
    bridge.append((a,b)) i range(M) range M a,b = map(int, input().split()) a map(int, input().split()) map int input().split() ().split () input split b bridge.append((a,b)) bridge.append bridge append (a,b) a b all =N*(N-1)//2 all N*(N-1)//2 N*(N-1) N N-1 N 1 2 ans =[0]*(M-1) +[all] ans [0]*(M-1) +[all] [0]*(M-1) [0] 0 M-1 M 1 [all] all uf =UnionFind(N) uf UnionFind(N) UnionFind N for i in range(M-1,0,-1):

    a,b =bridge[i]
    #事前につながっているかどうかで場合分け
    if uf.same(a-1,b-1):
        ans[i-1] =ans[i]
    #くっつけてから変化分を引く
    else:
        x_a =uf.size(a-1)
        x_b =uf.size(b-1)
        connection_bfo =x_a*(x_a -1)//2 +x_b*(x_b -1)//2
        connection_aft =(x_a +x_b) *(x_a +x_b -1)//2 
        ans[i-1] =ans[i] -connection_aft +connection_bfo
        uf.union(a-1,b-1) i range(M-1,0,-1) range M-1 M 1 0 -1 a,b =bridge[i] a bridge[i] bridge i b if uf.same(a-1,b-1):
        ans[i-1] =ans[i]
    #くっつけてから変化分を引く
    else:
        x_a =uf.size(a-1)
        x_b =uf.size(b-1)
        connection_bfo =x_a*(x_a -1)//2 +x_b*(x_b -1)//2
        connection_aft =(x_a +x_b) *(x_a +x_b -1)//2 
        ans[i-1] =ans[i] -connection_aft +connection_bfo
        uf.union(a-1,b-1) uf.same(a-1,b-1) uf.same uf same a-1 a 1 b-1 b 1 ans[i-1] =ans[i] ans[i-1] ans i-1 i 1 ans[i] ans i x_a =uf.size(a-1) x_a uf.size(a-1) uf.size uf size a-1 a 1 x_b =uf.size(b-1) x_b uf.size(b-1) uf.size uf size b-1 b 1 connection_bfo =x_a*(x_a -1)//2 +x_b*(x_b -1)//2 connection_bfo x_a*(x_a -1)//2 +x_b*(x_b -1)//2 x_a*(x_a -1)//2 x_a*(x_a -1) x_a x_a -1 x_a 1 2 x_b*(x_b -1)//2 x_b*(x_b -1) x_b x_b -1 x_b 1 2 connection_aft =(x_a +x_b) *(x_a +x_b -1)//2 connection_aft (x_a +x_b) *(x_a +x_b -1)//2 (x_a +x_b) *(x_a +x_b -1) x_a +x_b x_a x_b x_a +x_b -1 x_a +x_b x_a x_b 1 2 ans[i-1] =ans[i] -connection_aft +connection_bfo ans[i-1] ans i-1 i 1 ans[i] -connection_aft +connection_bfo ans[i] -connection_aft ans[i] ans i connection_aft connection_bfo uf.union(a-1,b-1) uf.union uf union a-1 a 1 b-1 b 1 print(i) for i in ans for i in ans i ans for i in ans print(i) print i [print(i) for i in ans] uf =UnionFind(N) UnionFind(N) uf all =N*(N-1)//2 N*(N-1)//2 all x_a =uf.size(a-1) uf.size(a-1) x_a bridge =[] [] bridge b =bridge[i] bridge[i] b N,M = map(int, input().split()) map(int, input().split()) N M = map(int, input().split()) map(int, input().split()) M b = map(int, input().split()) map(int, input().split()) b a,b = map(int, input().split()) map(int, input().split()) a connection_aft =(x_a +x_b) *(x_a +x_b -1)//2 (x_a +x_b) *(x_a +x_b -1)//2 connection_aft input = sys.stdin.readline sys.stdin.readline input a,b =bridge[i] bridge[i] a connection_bfo =x_a*(x_a -1)//2 +x_b*(x_b -1)//2 x_a*(x_a -1)//2 +x_b*(x_b -1)//2 connection_bfo class UnionFind():
    #https://note.nkmk.me/python-union-find/ 
    #note.nkmk.me  2019-08-18 
    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():
    #https://note.nkmk.me/python-union-find/ 
    #note.nkmk.me  2019-08-18 
    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 ans =[0]*(M-1) +[all] [0]*(M-1) +[all] ans x_b =uf.size(b-1) uf.size(b-1) x_b
class UnionFind():
    #https://note.nkmk.me/python-union-find/ 
    #note.nkmk.me  2019-08-18 
    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())

# 初期入力
import sys
input = sys.stdin.readline  #文字列では使わない

N,M = map(int, input().split())
bridge =[]
for i in range(M):
    a,b = map(int, input().split())
    bridge.append((a,b))

all =N*(N-1)//2 #行き来できる島の組み合わせ
ans =[0]*(M-1) +[all]
#print(ans)

#i 番目の橋が崩落した直後の不便さ＝i+1番目がまだ残っているときの不便さ
#   ⇒最後の橋から順番に作り、できた時の不便さ
uf =UnionFind(N)

for i in range(M-1,0,-1):

    a,b =bridge[i]
    #事前につながっているかどうかで場合分け
    if uf.same(a-1,b-1):
        ans[i-1] =ans[i]
    #くっつけてから変化分を引く
    else:
        x_a =uf.size(a-1)
        x_b =uf.size(b-1)
        connection_bfo =x_a*(x_a -1)//2 +x_b*(x_b -1)//2
        connection_aft =(x_a +x_b) *(x_a +x_b -1)//2 
        ans[i-1] =ans[i] -connection_aft +connection_bfo
        uf.union(a-1,b-1)
[print(i) for i in ans]
