
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 = list( map(int, input().split()) )

uf = UnionFind(N)
A = [0]*M
B = [0]*M
for i in range(M):
    a,b = list( map(int, input().split()) )
    A[i]=a-1
    B[i]=b-1

#print(A)
#print(B)

cmax = int(N*(N-1)/2)
FD = [cmax]*(M+1)
#print(FD)
for i in range(M):
    #print(uf)
    if uf.same(A[M-i-1],B[M-i-1]):
        FD[M-i-1] = FD[M-i]
    else:
        cless = uf.size(A[M-i-1])*uf.size(B[M-i-1])
        FD[M-i-1] = FD[M-i] - cless
        if FD[M-i-1]<0: FD[M-i-1]=0
    uf.union(A[M-1-i],B[M-1-i])

#print(uf)
#print(FD[1:])
for fd in FD[1:]:
    print(fd)

 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 = list( map(int, input().split()) ) N list( map(int, input().split()) ) list map(int, input().split()) map int input().split() ().split () input split M uf = UnionFind(N) uf UnionFind(N) UnionFind N A = [0]*M A [0]*M [0] 0 M B = [0]*M B [0]*M [0] 0 M for i in range(M):
    a,b = list( map(int, input().split()) )
    A[i]=a-1
    B[i]=b-1

#print(A)
#print(B) i range(M) range M a,b = list( map(int, input().split()) ) a list( map(int, input().split()) ) list map(int, input().split()) map int input().split() ().split () input split b A[i]=a-1 A[i] A i a-1 a 1 B[i]=b-1 B[i] B i b-1 b 1 cmax = int(N*(N-1)/2) cmax int(N*(N-1)/2) int N*(N-1)/2 N*(N-1) N N-1 N 1 2 FD = [cmax]*(M+1) FD [cmax]*(M+1) [cmax] cmax M+1 M 1 for i in range(M):
    #print(uf)
    if uf.same(A[M-i-1],B[M-i-1]):
        FD[M-i-1] = FD[M-i]
    else:
        cless = uf.size(A[M-i-1])*uf.size(B[M-i-1])
        FD[M-i-1] = FD[M-i] - cless
        if FD[M-i-1]<0: FD[M-i-1]=0
    uf.union(A[M-1-i],B[M-1-i])

#print(uf)
#print(FD[1:]) i range(M) range M if uf.same(A[M-i-1],B[M-i-1]):
        FD[M-i-1] = FD[M-i]
    else:
        cless = uf.size(A[M-i-1])*uf.size(B[M-i-1])
        FD[M-i-1] = FD[M-i] - cless
        if FD[M-i-1]<0: FD[M-i-1]=0
     uf.same(A[M-i-1],B[M-i-1]) uf.same uf same A[M-i-1] A M-i-1 M-i M i 1 B[M-i-1] B M-i-1 M-i M i 1 FD[M-i-1] = FD[M-i] FD[M-i-1] FD M-i-1 M-i M i 1 FD[M-i] FD M-i M i cless = uf.size(A[M-i-1])*uf.size(B[M-i-1]) cless uf.size(A[M-i-1])*uf.size(B[M-i-1]) uf.size(A[M-i-1]) uf.size uf size A[M-i-1] A M-i-1 M-i M i 1 uf.size(B[M-i-1]) uf.size uf size B[M-i-1] B M-i-1 M-i M i 1 FD[M-i-1] = FD[M-i] - cless FD[M-i-1] FD M-i-1 M-i M i 1 FD[M-i] - cless FD[M-i] FD M-i M i cless if FD[M-i-1]<0: FD[M-i-1]=0
     FD[M-i-1]<0 FD[M-i-1] FD M-i-1 M-i M i 1 0 uf.union(A[M-1-i],B[M-1-i]) uf.union uf union A[M-1-i] A M-1-i M-1 M 1 i B[M-1-i] B M-1-i M-1 M 1 i for fd in FD[1:]:
    print(fd) fd FD[1:] FD 1: 1 print(fd) print fd b = list( map(int, input().split()) ) list( map(int, input().split()) ) b A = [0]*M [0]*M A cless = uf.size(A[M-i-1])*uf.size(B[M-i-1]) uf.size(A[M-i-1])*uf.size(B[M-i-1]) cless FD = [cmax]*(M+1) [cmax]*(M+1) FD B = [0]*M [0]*M B 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 M = list( map(int, input().split()) ) list( map(int, input().split()) ) M N,M = list( map(int, input().split()) ) list( map(int, input().split()) ) N cmax = int(N*(N-1)/2) int(N*(N-1)/2) cmax uf = UnionFind(N) UnionFind(N) uf a,b = list( map(int, input().split()) ) list( map(int, input().split()) ) 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 = list( map(int, input().split()) )

uf = UnionFind(N)
A = [0]*M
B = [0]*M
for i in range(M):
    a,b = list( map(int, input().split()) )
    A[i]=a-1
    B[i]=b-1

#print(A)
#print(B)

cmax = int(N*(N-1)/2)
FD = [cmax]*(M+1)
#print(FD)
for i in range(M):
    #print(uf)
    if uf.same(A[M-i-1],B[M-i-1]):
        FD[M-i-1] = FD[M-i]
    else:
        cless = uf.size(A[M-i-1])*uf.size(B[M-i-1])
        FD[M-i-1] = FD[M-i] - cless
        if FD[M-i-1]<0: FD[M-i-1]=0
    uf.union(A[M-1-i],B[M-1-i])

#print(uf)
#print(FD[1:])
for fd in FD[1:]:
    print(fd)


