#!/usr/bin/env python3
import numpy as np

n, m = list(map(int, input().split()))

ab = [list(map(int, input().split())) for _ in range(m)]
ab.reverse()


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


tree = UnionFind(n)
buf = [n*(n-1)//2]
for i in range(len(ab)-1):
    a, b = ab[i]
    a, b = a-1, b-1
    if tree.same(a, b):
        buf.append(buf[-1])
        continue
    ra = tree.parents[tree.find(a)]
    rb = tree.parents[tree.find(b)]
    buf.append(buf[-1] - ra * rb)
    tree.union(a, b)

buf.reverse()
# ans = []
# roots = [-x for i, x in enumerate(tree.parents) if x < 0]
# roots = np.array(roots)
# ans_tmp = n*(n-1)//2-np.sum(roots*(roots-1))//2
# ans.append(ans_tmp)
# for a, b in reversed(ab):
#     tree.union(a-1, b-1)
#     roots = [-x for i, x in enumerate(tree.parents) if x < 0]
#     roots = np.array(roots)
#     ans_tmp = n*(n-1)//2-np.sum(roots*(roots-1))//2
#     ans.append(ans_tmp)

print('\n'.join(map(str, buf))) import numpy as np numpy n, m = list(map(int, input().split())) n list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split m list(map(int, input().split())) for _ in range(m) for _ in range(m) _ range(m) range m for _ in range(m) list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split ab = [list(map(int, input().split())) for _ in range(m)] ab [list(map(int, input().split())) for _ in range(m)] ab.reverse() ab.reverse ab reverse 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 tree = UnionFind(n) tree UnionFind(n) UnionFind n buf = [n*(n-1)//2] buf [n*(n-1)//2] n*(n-1)//2 n*(n-1) n n-1 n 1 2 for i in range(len(ab)-1):
    a, b = ab[i]
    a, b = a-1, b-1
    if tree.same(a, b):
        buf.append(buf[-1])
        continue
    ra = tree.parents[tree.find(a)]
    rb = tree.parents[tree.find(b)]
    buf.append(buf[-1] - ra * rb)
    tree.union(a, b) i range(len(ab)-1) range len(ab)-1 len(ab) len ab 1 a, b = ab[i] a ab[i] ab i b a, b = a-1, b-1 a a-1 a 1 b b-1 b 1 if tree.same(a, b):
        buf.append(buf[-1])
        continue
     tree.same(a, b) tree.same tree same a b buf.append(buf[-1]) buf.append buf append buf[-1] buf -1 continue ra = tree.parents[tree.find(a)] ra tree.parents[tree.find(a)] tree.parents tree parents tree.find(a) tree.find tree find a rb = tree.parents[tree.find(b)] rb tree.parents[tree.find(b)] tree.parents tree parents tree.find(b) tree.find tree find b buf.append(buf[-1] - ra * rb) buf.append buf append buf[-1] - ra * rb buf[-1] buf -1 ra * rb ra rb tree.union(a, b) tree.union tree union a b buf.reverse() buf.reverse buf reverse print('\n'.join(map(str, buf))) print '\n'.join(map(str, buf)) '\n'.join '\n' join map(str, buf) map str buf m = list(map(int, input().split())) list(map(int, input().split())) m ra = tree.parents[tree.find(a)] tree.parents[tree.find(a)] ra rb = tree.parents[tree.find(b)] tree.parents[tree.find(b)] rb 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 a, b = ab[i] ab[i] a ab = [list(map(int, input().split())) for _ in range(m)] [list(map(int, input().split())) for _ in range(m)] ab buf = [n*(n-1)//2] [n*(n-1)//2] buf n, m = list(map(int, input().split())) list(map(int, input().split())) n a, b = a-1, b-1 a-1 a tree = UnionFind(n) UnionFind(n) tree b = ab[i] ab[i] b b = a-1, b-1 b-1 b
#!/usr/bin/env python3
import numpy as np

n, m = list(map(int, input().split()))

ab = [list(map(int, input().split())) for _ in range(m)]
ab.reverse()


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


tree = UnionFind(n)
buf = [n*(n-1)//2]
for i in range(len(ab)-1):
    a, b = ab[i]
    a, b = a-1, b-1
    if tree.same(a, b):
        buf.append(buf[-1])
        continue
    ra = tree.parents[tree.find(a)]
    rb = tree.parents[tree.find(b)]
    buf.append(buf[-1] - ra * rb)
    tree.union(a, b)

buf.reverse()
# ans = []
# roots = [-x for i, x in enumerate(tree.parents) if x < 0]
# roots = np.array(roots)
# ans_tmp = n*(n-1)//2-np.sum(roots*(roots-1))//2
# ans.append(ans_tmp)
# for a, b in reversed(ab):
#     tree.union(a-1, b-1)
#     roots = [-x for i, x in enumerate(tree.parents) if x < 0]
#     roots = np.array(roots)
#     ans_tmp = n*(n-1)//2-np.sum(roots*(roots-1))//2
#     ans.append(ans_tmp)

print('\n'.join(map(str, buf)))
