import math
def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n_nodes, n_path = map(int,input().split())
paths = [[0,0] for _ in range(n_path)]
for i in range(n_path):
    a,b = map(int,input().split())
    paths[i] = [a-1,b-1]

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とyは-=1して使う
        '''
        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())

now_ans = combinations_count(n_nodes,2)
paths = paths[::-1]
uf = UnionFind(n_nodes)
ans_ls = [0] * (n_path)
ans_ls[-1] = now_ans
for i,path in enumerate(paths[:-1]):
    a,b = path
    if not uf.same(a,b):
        now_ans -= uf.size(a)*uf.size(b)
        uf.union(a,b)
    ans_ls[-2-i] = now_ans
for ans in ans_ls:
    print(ans)
     import math math def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) combinations_count return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) math.factorial(n) math.factorial math factorial n math.factorial(n - r) * math.factorial(r) math.factorial(n - r) math.factorial math factorial n - r n r math.factorial(r) math.factorial math factorial r n n r r n_nodes, n_path = map(int,input().split()) n_nodes map(int,input().split()) map int input().split() ().split () input split n_path [0,0] for _ in range(n_path) for _ in range(n_path) _ range(n_path) range n_path for _ in range(n_path) [0,0] 0 0 paths = [[0,0] for _ in range(n_path)] paths [[0,0] for _ in range(n_path)] for i in range(n_path):
    a,b = map(int,input().split())
    paths[i] = [a-1,b-1] i range(n_path) range n_path a,b = map(int,input().split()) a map(int,input().split()) map int input().split() ().split () input split b paths[i] = [a-1,b-1] paths[i] paths i [a-1,b-1] a-1 a 1 b-1 b 1 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とyは-=1して使う
        '''
        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とyは-=1して使う
        '''
        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とyは-=1して使う
        ''' 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 now_ans = combinations_count(n_nodes,2) now_ans combinations_count(n_nodes,2) combinations_count n_nodes 2 paths = paths[::-1] paths paths[::-1] paths ::-1 -1 uf = UnionFind(n_nodes) uf UnionFind(n_nodes) UnionFind n_nodes ans_ls = [0] * (n_path) ans_ls [0] * (n_path) [0] 0 n_path ans_ls[-1] = now_ans ans_ls[-1] ans_ls -1 now_ans for i,path in enumerate(paths[:-1]):
    a,b = path
    if not uf.same(a,b):
        now_ans -= uf.size(a)*uf.size(b)
        uf.union(a,b)
    ans_ls[-2-i] = now_ans i path enumerate(paths[:-1]) enumerate paths[:-1] paths :-1 -1 a,b = path a path b if not uf.same(a,b):
        now_ans -= uf.size(a)*uf.size(b)
        uf.union(a,b)
     not uf.same(a,b) uf.same(a,b) uf.same uf same a b now_ans -= uf.size(a)*uf.size(b) now_ans uf.size(a)*uf.size(b) uf.size(a) uf.size uf size a uf.size(b) uf.size uf size b uf.union(a,b) uf.union uf union a b ans_ls[-2-i] = now_ans ans_ls[-2-i] ans_ls -2-i -2 i now_ans for ans in ans_ls:
    print(ans)
     ans ans_ls print(ans) print ans n_nodes, n_path = map(int,input().split()) map(int,input().split()) n_nodes def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) combinations_count paths = [[0,0] for _ in range(n_path)] [[0,0] for _ in range(n_path)] paths paths = paths[::-1] paths[::-1] paths a,b = map(int,input().split()) map(int,input().split()) a b = path path b b = map(int,input().split()) map(int,input().split()) b now_ans = combinations_count(n_nodes,2) combinations_count(n_nodes,2) now_ans 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とyは-=1して使う
        '''
        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とyは-=1して使う
        '''
        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 a,b = path path a uf = UnionFind(n_nodes) UnionFind(n_nodes) uf ans_ls = [0] * (n_path) [0] * (n_path) ans_ls n_path = map(int,input().split()) map(int,input().split()) n_path now_ans -= uf.size(a)*uf.size(b) uf.size(a)*uf.size(b) now_ans
import math
def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n_nodes, n_path = map(int,input().split())
paths = [[0,0] for _ in range(n_path)]
for i in range(n_path):
    a,b = map(int,input().split())
    paths[i] = [a-1,b-1]

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とyは-=1して使う
        '''
        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())

now_ans = combinations_count(n_nodes,2)
paths = paths[::-1]
uf = UnionFind(n_nodes)
ans_ls = [0] * (n_path)
ans_ls[-1] = now_ans
for i,path in enumerate(paths[:-1]):
    a,b = path
    if not uf.same(a,b):
        now_ans -= uf.size(a)*uf.size(b)
        uf.union(a,b)
    ans_ls[-2-i] = now_ans
for ans in ans_ls:
    print(ans)
    
