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())
N, M = map(int,input().split())
uf = UnionFind(N)
B = []
for k in range(M):
    B.append(list(map(int,input().split())))
B = B[::-1]

ans = []
a = N*(N-1)//2
for e in B:
    ans.append(a)
    if uf.same(e[0]-1,e[1]-1) == False:
        s, t = uf.size(e[0]-1), uf.size(e[1]-1)
        a -= (s+t)*(s+t-1)//2 - s*(s-1)//2 - t*(t-1)//2
        uf.union(e[0]-1,e[1]-1)
    else:
        pass

print(*ans[::-1], sep = "\n") 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 N, M = map(int,input().split()) N map(int,input().split()) map int input().split() ().split () input split M uf = UnionFind(N) uf UnionFind(N) UnionFind N B = [] B [] for k in range(M):
    B.append(list(map(int,input().split()))) k range(M) range M B.append(list(map(int,input().split()))) B.append B append list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split B = B[::-1] B B[::-1] B ::-1 -1 ans = [] ans [] a = N*(N-1)//2 a N*(N-1)//2 N*(N-1) N N-1 N 1 2 for e in B:
    ans.append(a)
    if uf.same(e[0]-1,e[1]-1) == False:
        s, t = uf.size(e[0]-1), uf.size(e[1]-1)
        a -= (s+t)*(s+t-1)//2 - s*(s-1)//2 - t*(t-1)//2
        uf.union(e[0]-1,e[1]-1)
    else:
        pass e B ans.append(a) ans.append ans append a if uf.same(e[0]-1,e[1]-1) == False:
        s, t = uf.size(e[0]-1), uf.size(e[1]-1)
        a -= (s+t)*(s+t-1)//2 - s*(s-1)//2 - t*(t-1)//2
        uf.union(e[0]-1,e[1]-1)
    else:
        pass uf.same(e[0]-1,e[1]-1) == False uf.same(e[0]-1,e[1]-1) uf.same uf same e[0]-1 e[0] e 0 1 e[1]-1 e[1] e 1 1 False s, t = uf.size(e[0]-1), uf.size(e[1]-1) s uf.size(e[0]-1) uf.size uf size e[0]-1 e[0] e 0 1 t uf.size(e[1]-1) uf.size uf size e[1]-1 e[1] e 1 1 a -= (s+t)*(s+t-1)//2 - s*(s-1)//2 - t*(t-1)//2 a (s+t)*(s+t-1)//2 - s*(s-1)//2 - t*(t-1)//2 (s+t)*(s+t-1)//2 - s*(s-1)//2 (s+t)*(s+t-1)//2 (s+t)*(s+t-1) s+t s t s+t-1 s+t s t 1 2 s*(s-1)//2 s*(s-1) s s-1 s 1 2 t*(t-1)//2 t*(t-1) t t-1 t 1 2 uf.union(e[0]-1,e[1]-1) uf.union uf union e[0]-1 e[0] e 0 1 e[1]-1 e[1] e 1 1 print(*ans[::-1], sep = "\n") print *ans[::-1] ans[::-1] ans ::-1 -1 sep = "\n" sep "\n" B = [] [] B s, t = uf.size(e[0]-1), uf.size(e[1]-1) uf.size(e[0]-1) s B = B[::-1] B[::-1] B uf = UnionFind(N) UnionFind(N) uf ans = [] [] 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 = 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 N, M = map(int,input().split()) map(int,input().split()) N a = N*(N-1)//2 N*(N-1)//2 a t = uf.size(e[0]-1), uf.size(e[1]-1) uf.size(e[1]-1) t M = map(int,input().split()) map(int,input().split()) M a -= (s+t)*(s+t-1)//2 - s*(s-1)//2 - t*(t-1)//2 (s+t)*(s+t-1)//2 - s*(s-1)//2 - t*(t-1)//2 a
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())
N, M = map(int,input().split())
uf = UnionFind(N)
B = []
for k in range(M):
    B.append(list(map(int,input().split())))
B = B[::-1]

ans = []
a = N*(N-1)//2
for e in B:
    ans.append(a)
    if uf.same(e[0]-1,e[1]-1) == False:
        s, t = uf.size(e[0]-1), uf.size(e[1]-1)
        a -= (s+t)*(s+t-1)//2 - s*(s-1)//2 - t*(t-1)//2
        uf.union(e[0]-1,e[1]-1)
    else:
        pass

print(*ans[::-1], sep = "\n")
