#AC

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 culc(x):
    return x*(x-1)//2

n,m=map(int,input().split())
edge=[]
for i in range(m):
    a,b=map(int,input().split())
    a-=1
    b-=1
    edge.append((a,b))


ans=[culc(n)]

uf=UnionFind(n)
for i in range(m):
    a,b=edge[m-i-1]
    if uf.same(a,b):
        ans.append(ans[-1])
    else:
        member_a=uf.size(a)
        member_b=uf.size(b)
        uf.union(a,b)
        #不便さの減少幅(>=0)
        add=culc(uf.size(a))-culc(member_a)-culc(member_b)
        ans.append(ans[-1]-add)


for i in range(m):
    print(ans[m-i-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 = 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 culc(x):
    return x*(x-1)//2 culc return x*(x-1)//2 x*(x-1)//2 x*(x-1) x x-1 x 1 2 x x n,m=map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split m edge=[] edge [] for i in range(m):
    a,b=map(int,input().split())
    a-=1
    b-=1
    edge.append((a,b)) i range(m) range m a,b=map(int,input().split()) a map(int,input().split()) map int input().split() ().split () input split b a-=1 a 1 b-=1 b 1 edge.append((a,b)) edge.append edge append (a,b) a b ans=[culc(n)] ans [culc(n)] culc(n) culc n uf=UnionFind(n) uf UnionFind(n) UnionFind n for i in range(m):
    a,b=edge[m-i-1]
    if uf.same(a,b):
        ans.append(ans[-1])
    else:
        member_a=uf.size(a)
        member_b=uf.size(b)
        uf.union(a,b)
        #不便さの減少幅(>=0)
        add=culc(uf.size(a))-culc(member_a)-culc(member_b)
        ans.append(ans[-1]-add) i range(m) range m a,b=edge[m-i-1] a edge[m-i-1] edge m-i-1 m-i m i 1 b if uf.same(a,b):
        ans.append(ans[-1])
    else:
        member_a=uf.size(a)
        member_b=uf.size(b)
        uf.union(a,b)
        #不便さの減少幅(>=0)
        add=culc(uf.size(a))-culc(member_a)-culc(member_b)
        ans.append(ans[-1]-add) uf.same(a,b) uf.same uf same a b ans.append(ans[-1]) ans.append ans append ans[-1] ans -1 member_a=uf.size(a) member_a uf.size(a) uf.size uf size a member_b=uf.size(b) member_b uf.size(b) uf.size uf size b uf.union(a,b) uf.union uf union a b add=culc(uf.size(a))-culc(member_a)-culc(member_b) add culc(uf.size(a))-culc(member_a)-culc(member_b) culc(uf.size(a))-culc(member_a) culc(uf.size(a)) culc uf.size(a) uf.size uf size a culc(member_a) culc member_a culc(member_b) culc member_b ans.append(ans[-1]-add) ans.append ans append ans[-1]-add ans[-1] ans -1 add 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 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 b-=1 1 b member_b=uf.size(b) uf.size(b) member_b uf=UnionFind(n) UnionFind(n) uf n,m=map(int,input().split()) map(int,input().split()) n b=edge[m-i-1] edge[m-i-1] b def culc(x):
    return x*(x-1)//2 def culc(x):
    return x*(x-1)//2 culc member_a=uf.size(a) uf.size(a) member_a a-=1 1 a ans=[culc(n)] [culc(n)] ans a,b=edge[m-i-1] edge[m-i-1] a edge=[] [] edge m=map(int,input().split()) map(int,input().split()) m a,b=map(int,input().split()) map(int,input().split()) a b=map(int,input().split()) map(int,input().split()) b add=culc(uf.size(a))-culc(member_a)-culc(member_b) culc(uf.size(a))-culc(member_a)-culc(member_b) add
#AC

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 culc(x):
    return x*(x-1)//2

n,m=map(int,input().split())
edge=[]
for i in range(m):
    a,b=map(int,input().split())
    a-=1
    b-=1
    edge.append((a,b))


ans=[culc(n)]

uf=UnionFind(n)
for i in range(m):
    a,b=edge[m-i-1]
    if uf.same(a,b):
        ans.append(ans[-1])
    else:
        member_a=uf.size(a)
        member_b=uf.size(b)
        uf.union(a,b)
        #不便さの減少幅(>=0)
        add=culc(uf.size(a))-culc(member_a)-culc(member_b)
        ans.append(ans[-1]-add)


for i in range(m):
    print(ans[m-i-1])



