import math
#import numpy as np
import queue
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)

#UnionFindのクラス
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 = map(int,ipt().split())
    bl = [tuple(map(int,ipt().split())) for i in range(m)]
    uf = UnionFind(n+1)
    num = n*(n-1)//2
    ans = [str(num)]
    for ai,bi in bl[::-1]:
        if uf.same(ai,bi):
            ans.append(str(num))
        else:
            num -= uf.size(ai)*uf.size(bi)
            ans.append(str(num))
            uf.union(ai,bi)
    for i in range(m):
        print(ans[m-i-1])

    return

if __name__ == '__main__':
    main() import math math import queue queue from collections import deque,defaultdict import heapq as hpq heapq from sys import stdin,setrecursionlimit ipt = stdin.readline ipt stdin.readline stdin readline setrecursionlimit(10**7) setrecursionlimit 10**7 10 7 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 = map(int,ipt().split())
    bl = [tuple(map(int,ipt().split())) for i in range(m)]
    uf = UnionFind(n+1)
    num = n*(n-1)//2
    ans = [str(num)]
    for ai,bi in bl[::-1]:
        if uf.same(ai,bi):
            ans.append(str(num))
        else:
            num -= uf.size(ai)*uf.size(bi)
            ans.append(str(num))
            uf.union(ai,bi)
    for i in range(m):
        print(ans[m-i-1])

    return main n,m = map(int,ipt().split()) n map(int,ipt().split()) map int ipt().split() ().split () ipt split m tuple(map(int,ipt().split())) for i in range(m) for i in range(m) i range(m) range m for i in range(m) tuple(map(int,ipt().split())) tuple map(int,ipt().split()) map int ipt().split() ().split () ipt split bl = [tuple(map(int,ipt().split())) for i in range(m)] bl [tuple(map(int,ipt().split())) for i in range(m)] uf = UnionFind(n+1) uf UnionFind(n+1) UnionFind n+1 n 1 num = n*(n-1)//2 num n*(n-1)//2 n*(n-1) n n-1 n 1 2 ans = [str(num)] ans [str(num)] str(num) str num for ai,bi in bl[::-1]:
        if uf.same(ai,bi):
            ans.append(str(num))
        else:
            num -= uf.size(ai)*uf.size(bi)
            ans.append(str(num))
            uf.union(ai,bi)
     ai bi bl[::-1] bl ::-1 -1 if uf.same(ai,bi):
            ans.append(str(num))
        else:
            num -= uf.size(ai)*uf.size(bi)
            ans.append(str(num))
            uf.union(ai,bi)
     uf.same(ai,bi) uf.same uf same ai bi ans.append(str(num)) ans.append ans append str(num) str num num -= uf.size(ai)*uf.size(bi) num uf.size(ai)*uf.size(bi) uf.size(ai) uf.size uf size ai uf.size(bi) uf.size uf size bi ans.append(str(num)) ans.append ans append str(num) str num uf.union(ai,bi) uf.union uf union ai bi for i in range(m):
        print(ans[m-i-1])

     i range(m) range m print(ans[m-i-1]) print ans[m-i-1] ans m-i-1 m-i m i 1 return if __name__ == '__main__':
    main() __name__ == '__main__' __name__ '__main__' main() main 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 main():
    n,m = map(int,ipt().split())
    bl = [tuple(map(int,ipt().split())) for i in range(m)]
    uf = UnionFind(n+1)
    num = n*(n-1)//2
    ans = [str(num)]
    for ai,bi in bl[::-1]:
        if uf.same(ai,bi):
            ans.append(str(num))
        else:
            num -= uf.size(ai)*uf.size(bi)
            ans.append(str(num))
            uf.union(ai,bi)
    for i in range(m):
        print(ans[m-i-1])

    return def main():
    n,m = map(int,ipt().split())
    bl = [tuple(map(int,ipt().split())) for i in range(m)]
    uf = UnionFind(n+1)
    num = n*(n-1)//2
    ans = [str(num)]
    for ai,bi in bl[::-1]:
        if uf.same(ai,bi):
            ans.append(str(num))
        else:
            num -= uf.size(ai)*uf.size(bi)
            ans.append(str(num))
            uf.union(ai,bi)
    for i in range(m):
        print(ans[m-i-1])

    return main ipt = stdin.readline stdin.readline ipt
import math
#import numpy as np
import queue
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)

#UnionFindのクラス
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 = map(int,ipt().split())
    bl = [tuple(map(int,ipt().split())) for i in range(m)]
    uf = UnionFind(n+1)
    num = n*(n-1)//2
    ans = [str(num)]
    for ai,bi in bl[::-1]:
        if uf.same(ai,bi):
            ans.append(str(num))
        else:
            num -= uf.size(ai)*uf.size(bi)
            ans.append(str(num))
            uf.union(ai,bi)
    for i in range(m):
        print(ans[m-i-1])

    return

if __name__ == '__main__':
    main()
