from collections import Counter
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 0

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        tmp = abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 + abs(self.parents[y]) * (abs(self.parents[y])-1) / 2 
        self.parents[x] += self.parents[y]
        self.parents[y] = x
        return abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 - tmp

    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 all_group_members_comb(self):
        tmp = 0
        self_roots = self.roots()
        for r in self_roots:
          len_member = len(self.members(r))
          if len_member > 1:
            tmp += len_member * (len_member-1) / 2
        return tmp
    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

N,M = list(map(int,input().split()))
ab = [list(map(int,input().split())) for _ in range(M)]
uf = UnionFind(N)
N_comb = N*(N-1)/2
ans = [N_comb]
for i in range(1,M):
  a,b = ab[-i]
  N_comb -= uf.union(a-1,b-1)
  ans.append(N_comb)

ans.sort()
for i in range(M):
  print(int(ans[i])) from collections import Counter 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 0

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        tmp = abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 + abs(self.parents[y]) * (abs(self.parents[y])-1) / 2 
        self.parents[x] += self.parents[y]
        self.parents[y] = x
        return abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 - tmp

    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 all_group_members_comb(self):
        tmp = 0
        self_roots = self.roots()
        for r in self_roots:
          len_member = len(self.members(r))
          if len_member > 1:
            tmp += len_member * (len_member-1) / 2
        return tmp
    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 0

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        tmp = abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 + abs(self.parents[y]) * (abs(self.parents[y])-1) / 2 
        self.parents[x] += self.parents[y]
        self.parents[y] = x
        return abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 - tmp

     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 0

         x == y x y return 0 0 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 tmp = abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 + abs(self.parents[y]) * (abs(self.parents[y])-1) / 2 tmp abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 + abs(self.parents[y]) * (abs(self.parents[y])-1) / 2 abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 abs(self.parents[x]) * (abs(self.parents[x])-1) abs(self.parents[x]) abs self.parents[x] self.parents self parents x abs(self.parents[x])-1 abs(self.parents[x]) abs self.parents[x] self.parents self parents x 1 2 abs(self.parents[y]) * (abs(self.parents[y])-1) / 2 abs(self.parents[y]) * (abs(self.parents[y])-1) abs(self.parents[y]) abs self.parents[y] self.parents self parents y abs(self.parents[y])-1 abs(self.parents[y]) abs self.parents[y] self.parents self parents y 1 2 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 return abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 - tmp abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 - tmp abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 abs(self.parents[x]) * (abs(self.parents[x])-1) abs(self.parents[x]) abs self.parents[x] self.parents self parents x abs(self.parents[x])-1 abs(self.parents[x]) abs self.parents[x] self.parents self parents x 1 2 tmp 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 all_group_members_comb(self):
        tmp = 0
        self_roots = self.roots()
        for r in self_roots:
          len_member = len(self.members(r))
          if len_member > 1:
            tmp += len_member * (len_member-1) / 2
        return tmp
     all_group_members_comb tmp = 0 tmp 0 self_roots = self.roots() self_roots self.roots() self.roots self roots for r in self_roots:
          len_member = len(self.members(r))
          if len_member > 1:
            tmp += len_member * (len_member-1) / 2
         r self_roots len_member = len(self.members(r)) len_member len(self.members(r)) len self.members(r) self.members self members r if len_member > 1:
            tmp += len_member * (len_member-1) / 2
         len_member > 1 len_member 1 tmp += len_member * (len_member-1) / 2 tmp len_member * (len_member-1) / 2 len_member * (len_member-1) len_member len_member-1 len_member 1 2 return tmp tmp 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 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)] uf = UnionFind(N) uf UnionFind(N) UnionFind N N_comb = N*(N-1)/2 N_comb N*(N-1)/2 N*(N-1) N N-1 N 1 2 ans = [N_comb] ans [N_comb] N_comb for i in range(1,M):
  a,b = ab[-i]
  N_comb -= uf.union(a-1,b-1)
  ans.append(N_comb) i range(1,M) range 1 M a,b = ab[-i] a ab[-i] ab -i i b N_comb -= uf.union(a-1,b-1) N_comb uf.union(a-1,b-1) uf.union uf union a-1 a 1 b-1 b 1 ans.append(N_comb) ans.append ans append N_comb ans.sort() ans.sort ans sort for i in range(M):
  print(int(ans[i])) i range(M) range M print(int(ans[i])) print int(ans[i]) int ans[i] ans i N_comb = N*(N-1)/2 N*(N-1)/2 N_comb N,M = list(map(int,input().split())) list(map(int,input().split())) N ab = [list(map(int,input().split())) for _ in range(M)] [list(map(int,input().split())) for _ in range(M)] ab 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 0

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        tmp = abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 + abs(self.parents[y]) * (abs(self.parents[y])-1) / 2 
        self.parents[x] += self.parents[y]
        self.parents[y] = x
        return abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 - tmp

    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 all_group_members_comb(self):
        tmp = 0
        self_roots = self.roots()
        for r in self_roots:
          len_member = len(self.members(r))
          if len_member > 1:
            tmp += len_member * (len_member-1) / 2
        return tmp
    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 0

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        tmp = abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 + abs(self.parents[y]) * (abs(self.parents[y])-1) / 2 
        self.parents[x] += self.parents[y]
        self.parents[y] = x
        return abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 - tmp

    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 all_group_members_comb(self):
        tmp = 0
        self_roots = self.roots()
        for r in self_roots:
          len_member = len(self.members(r))
          if len_member > 1:
            tmp += len_member * (len_member-1) / 2
        return tmp
    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots()) UnionFind ans = [N_comb] [N_comb] ans uf = UnionFind(N) UnionFind(N) uf M = list(map(int,input().split())) list(map(int,input().split())) M b = ab[-i] ab[-i] b a,b = ab[-i] ab[-i] a N_comb -= uf.union(a-1,b-1) uf.union(a-1,b-1) N_comb
from collections import Counter
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 0

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        tmp = abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 + abs(self.parents[y]) * (abs(self.parents[y])-1) / 2 
        self.parents[x] += self.parents[y]
        self.parents[y] = x
        return abs(self.parents[x]) * (abs(self.parents[x])-1) / 2 - tmp

    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 all_group_members_comb(self):
        tmp = 0
        self_roots = self.roots()
        for r in self_roots:
          len_member = len(self.members(r))
          if len_member > 1:
            tmp += len_member * (len_member-1) / 2
        return tmp
    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

N,M = list(map(int,input().split()))
ab = [list(map(int,input().split())) for _ in range(M)]
uf = UnionFind(N)
N_comb = N*(N-1)/2
ans = [N_comb]
for i in range(1,M):
  a,b = ab[-i]
  N_comb -= uf.union(a-1,b-1)
  ans.append(N_comb)

ans.sort()
for i in range(M):
  print(int(ans[i]))