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 = [list(map(int, input().split())) for i in range(m)]
b.reverse()
def kumi(x):
    return x*(x-1)//2
c = kumi(n)
ans = [0 for i in range(m)]
nextans = c
for i,bri in enumerate(b):
    ans[m-1-i] = nextans
    if uf.same(bri[0]-1, bri[1]-1):
        continue
    else:
        a_num = uf.size(bri[0]-1)
        b_num = uf.size(bri[1]-1)
        a_num = kumi(a_num)
        b_num = kumi(b_num)
        uf.union(bri[0]-1, bri[1]-1)
        c_num = uf.size(bri[0]-1)
        c_num = kumi(c_num)
        nextans = nextans - (c_num - a_num - b_num)
for i in range(m):
    print(ans[i]) 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 list(map(int, input().split())) for i in range(m) for i in range(m) i range(m) range m for i in range(m) list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split b = [list(map(int, input().split())) for i in range(m)] b [list(map(int, input().split())) for i in range(m)] b.reverse() b.reverse b reverse def kumi(x):
    return x*(x-1)//2 kumi return x*(x-1)//2 x*(x-1)//2 x*(x-1) x x-1 x 1 2 x x c = kumi(n) c kumi(n) kumi n 0 for i in range(m) for i in range(m) i range(m) range m for i in range(m) 0 ans = [0 for i in range(m)] ans [0 for i in range(m)] nextans = c nextans c for i,bri in enumerate(b):
    ans[m-1-i] = nextans
    if uf.same(bri[0]-1, bri[1]-1):
        continue
    else:
        a_num = uf.size(bri[0]-1)
        b_num = uf.size(bri[1]-1)
        a_num = kumi(a_num)
        b_num = kumi(b_num)
        uf.union(bri[0]-1, bri[1]-1)
        c_num = uf.size(bri[0]-1)
        c_num = kumi(c_num)
        nextans = nextans - (c_num - a_num - b_num) i bri enumerate(b) enumerate b ans[m-1-i] = nextans ans[m-1-i] ans m-1-i m-1 m 1 i nextans if uf.same(bri[0]-1, bri[1]-1):
        continue
    else:
        a_num = uf.size(bri[0]-1)
        b_num = uf.size(bri[1]-1)
        a_num = kumi(a_num)
        b_num = kumi(b_num)
        uf.union(bri[0]-1, bri[1]-1)
        c_num = uf.size(bri[0]-1)
        c_num = kumi(c_num)
        nextans = nextans - (c_num - a_num - b_num) uf.same(bri[0]-1, bri[1]-1) uf.same uf same bri[0]-1 bri[0] bri 0 1 bri[1]-1 bri[1] bri 1 1 continue a_num = uf.size(bri[0]-1) a_num uf.size(bri[0]-1) uf.size uf size bri[0]-1 bri[0] bri 0 1 b_num = uf.size(bri[1]-1) b_num uf.size(bri[1]-1) uf.size uf size bri[1]-1 bri[1] bri 1 1 a_num = kumi(a_num) a_num kumi(a_num) kumi a_num b_num = kumi(b_num) b_num kumi(b_num) kumi b_num uf.union(bri[0]-1, bri[1]-1) uf.union uf union bri[0]-1 bri[0] bri 0 1 bri[1]-1 bri[1] bri 1 1 c_num = uf.size(bri[0]-1) c_num uf.size(bri[0]-1) uf.size uf size bri[0]-1 bri[0] bri 0 1 c_num = kumi(c_num) c_num kumi(c_num) kumi c_num nextans = nextans - (c_num - a_num - b_num) nextans nextans - (c_num - a_num - b_num) nextans c_num - a_num - b_num c_num - a_num c_num a_num b_num for i in range(m):
    print(ans[i]) i range(m) range m print(ans[i]) print ans[i] ans i 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 nextans = c c nextans b = [list(map(int, input().split())) for i in range(m)] [list(map(int, input().split())) for i in range(m)] b nextans = nextans - (c_num - a_num - b_num) nextans - (c_num - a_num - b_num) nextans ans = [0 for i in range(m)] [0 for i in range(m)] ans c_num = uf.size(bri[0]-1) uf.size(bri[0]-1) c_num a_num = uf.size(bri[0]-1) uf.size(bri[0]-1) a_num m = map(int, input().split()) map(int, input().split()) m c = kumi(n) kumi(n) c b_num = uf.size(bri[1]-1) uf.size(bri[1]-1) b_num b_num = kumi(b_num) kumi(b_num) b_num uf = UnionFind(n) UnionFind(n) uf c_num = kumi(c_num) kumi(c_num) c_num def kumi(x):
    return x*(x-1)//2 def kumi(x):
    return x*(x-1)//2 kumi a_num = kumi(a_num) kumi(a_num) a_num
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 = [list(map(int, input().split())) for i in range(m)]
b.reverse()
def kumi(x):
    return x*(x-1)//2
c = kumi(n)
ans = [0 for i in range(m)]
nextans = c
for i,bri in enumerate(b):
    ans[m-1-i] = nextans
    if uf.same(bri[0]-1, bri[1]-1):
        continue
    else:
        a_num = uf.size(bri[0]-1)
        b_num = uf.size(bri[1]-1)
        a_num = kumi(a_num)
        b_num = kumi(b_num)
        uf.union(bri[0]-1, bri[1]-1)
        c_num = uf.size(bri[0]-1)
        c_num = kumi(c_num)
        nextans = nextans - (c_num - a_num - b_num)
for i in range(m):
    print(ans[i])