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())
AB = []
for _ in range(M):
  A, B = map(int, input().split())
  AB.append((A-1, B-1))

uf = UnionFind(N)
unhappy = [N*(N-1)//2]

def conb(x):
  return x*(x-1)//2

for A, B in reversed(AB):
  old_ap, old_bp = uf.find(A), uf.find(B)
  if old_ap == old_bp:
    uf.union(A, B)
    unhappy.append(unhappy[-1])
  else:
    old_happy = conb(uf.size(old_ap)) + conb(uf.size(old_bp))
    uf.union(A, B)
    new_happy = conb(uf.size(A))
    happy = new_happy - old_happy
    unhappy.append(unhappy[-1] - happy)

print(*reversed(unhappy[:-1]), sep="\n") 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 AB = [] AB [] for _ in range(M):
  A, B = map(int, input().split())
  AB.append((A-1, B-1)) _ range(M) range M A, B = map(int, input().split()) A map(int, input().split()) map int input().split() ().split () input split B AB.append((A-1, B-1)) AB.append AB append (A-1, B-1) A-1 A 1 B-1 B 1 uf = UnionFind(N) uf UnionFind(N) UnionFind N unhappy = [N*(N-1)//2] unhappy [N*(N-1)//2] N*(N-1)//2 N*(N-1) N N-1 N 1 2 def conb(x):
  return x*(x-1)//2 conb return x*(x-1)//2 x*(x-1)//2 x*(x-1) x x-1 x 1 2 x x for A, B in reversed(AB):
  old_ap, old_bp = uf.find(A), uf.find(B)
  if old_ap == old_bp:
    uf.union(A, B)
    unhappy.append(unhappy[-1])
  else:
    old_happy = conb(uf.size(old_ap)) + conb(uf.size(old_bp))
    uf.union(A, B)
    new_happy = conb(uf.size(A))
    happy = new_happy - old_happy
    unhappy.append(unhappy[-1] - happy) A B reversed(AB) reversed AB old_ap, old_bp = uf.find(A), uf.find(B) old_ap uf.find(A) uf.find uf find A old_bp uf.find(B) uf.find uf find B if old_ap == old_bp:
    uf.union(A, B)
    unhappy.append(unhappy[-1])
  else:
    old_happy = conb(uf.size(old_ap)) + conb(uf.size(old_bp))
    uf.union(A, B)
    new_happy = conb(uf.size(A))
    happy = new_happy - old_happy
    unhappy.append(unhappy[-1] - happy) old_ap == old_bp old_ap old_bp uf.union(A, B) uf.union uf union A B unhappy.append(unhappy[-1]) unhappy.append unhappy append unhappy[-1] unhappy -1 old_happy = conb(uf.size(old_ap)) + conb(uf.size(old_bp)) old_happy conb(uf.size(old_ap)) + conb(uf.size(old_bp)) conb(uf.size(old_ap)) conb uf.size(old_ap) uf.size uf size old_ap conb(uf.size(old_bp)) conb uf.size(old_bp) uf.size uf size old_bp uf.union(A, B) uf.union uf union A B new_happy = conb(uf.size(A)) new_happy conb(uf.size(A)) conb uf.size(A) uf.size uf size A happy = new_happy - old_happy happy new_happy - old_happy new_happy old_happy unhappy.append(unhappy[-1] - happy) unhappy.append unhappy append unhappy[-1] - happy unhappy[-1] unhappy -1 happy print(*reversed(unhappy[:-1]), sep="\n") print *reversed(unhappy[:-1]) reversed(unhappy[:-1]) reversed unhappy[:-1] unhappy :-1 -1 sep="\n" sep "\n" def conb(x):
  return x*(x-1)//2 def conb(x):
  return x*(x-1)//2 conb old_bp = uf.find(A), uf.find(B) uf.find(B) old_bp uf = UnionFind(N) UnionFind(N) uf old_happy = conb(uf.size(old_ap)) + conb(uf.size(old_bp)) conb(uf.size(old_ap)) + conb(uf.size(old_bp)) old_happy N, M = map(int, input().split()) map(int, input().split()) N happy = new_happy - old_happy new_happy - old_happy happy new_happy = conb(uf.size(A)) conb(uf.size(A)) new_happy B = map(int, input().split()) map(int, input().split()) 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 = map(int, input().split()) map(int, input().split()) M old_ap, old_bp = uf.find(A), uf.find(B) uf.find(A) old_ap unhappy = [N*(N-1)//2] [N*(N-1)//2] unhappy AB = [] [] AB A, B = map(int, input().split()) 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 = map(int, input().split())
AB = []
for _ in range(M):
  A, B = map(int, input().split())
  AB.append((A-1, B-1))

uf = UnionFind(N)
unhappy = [N*(N-1)//2]

def conb(x):
  return x*(x-1)//2

for A, B in reversed(AB):
  old_ap, old_bp = uf.find(A), uf.find(B)
  if old_ap == old_bp:
    uf.union(A, B)
    unhappy.append(unhappy[-1])
  else:
    old_happy = conb(uf.size(old_ap)) + conb(uf.size(old_bp))
    uf.union(A, B)
    new_happy = conb(uf.size(A))
    happy = new_happy - old_happy
    unhappy.append(unhappy[-1] - happy)

print(*reversed(unhappy[:-1]), sep="\n")