output_description: In the order i = 1, 2, ..., M, print the inconvenience just after the i-th
  bridge collapses. Note that the answer may not fit into a 32-bit integer type.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N M
      A_1 B_1
      A_2 B_2
      \vdots
      A_M B_M
attempt: n, m = map(int, input().split())
  ab = []
  for _ in range(m):
      a, b = map(int, input().split())
      ab.append([a, b])
  
  
  # %%
  # n, m, ab = 4, 5, [[1, 2], [3, 4], [1, 3], [2, 3], [1, 4]]
  
  
  # %%
  import math
  
  # %%
  n_comb = math.factorial(n) // (math.factorial(n - 2) * math.factorial(2))
  
  
  # %%
  ans_list = [n_comb]
  
  
  # %%
  group_sets = []
  
  for abi in ab[::-1]:
      ai, bi = abi
  
      difficulty = 0
      flag_new = True
      flag_double = 0
      for g in group_sets:
          if ai in g or bi in g:
              # check double
              difficulty2 = 0
              for g2 in group_sets:
                  if ai in g2 or bi in g2:
                      flag_double += 1
                      difficulty2 += len(g2)
  
              if flag_double >= 2:
                  difficulty += difficulty2
                  continue
              elif ai in g:
                  difficulty += len(g)
                  g.add(bi)
                  flag_new = False
              elif bi in g:
                  difficulty += len(g)
                  g.add(ai)
                  flag_new = False
  
      if flag_new:
          group_sets.append({ai, bi})
          difficulty += 1
  
      ans_list.append(max(ans_list[-1] - difficulty, 0))
  
  
  # %%
  ans_list = ans_list[:-1]
  for i in ans_list[::-1]:
      print(i)
  
  # %%
  
  
  # %%
  
problem_description: Statement
  
  There are N islands and M bridges.
  
  The i-th bridge connects the A_i-th and B_i-th islands bidirectionally.
  
  Initially, we can travel between any two islands using some of these bridges.
  
  However, the results of a survey show that these bridges will all collapse
  because of aging, in the order from the first bridge to the M-th bridge.
  
  Let the **inconvenience** be the number of pairs of islands (a, b) (a < b)
  such that we are no longer able to travel between the a-th and b-th islands
  using some of the bridges remaining.
  
  For each i (1 \leq i \leq M), find the inconvenience just after the i-th
  bridge collapses.
samples: [{"input": "4 5\n    1 2\n    3 4\n    1 3\n    2 3\n    1 4", "output": "0\n    0\n    4\n    5\n    6\n    \n\nFor example, when the first to third bridges have collapsed, the inconvenience\nis 4 since we can no longer travel between the pairs (1, 2), (1, 3), (2, 4)\nand (3, 4).\n\n* * *"}, {"input": "6 5\n    2 3\n    1 2\n    5 6\n    3 4\n    4 5", "output": "8\n    9\n    12\n    14\n    15\n    \n\n* * *"}, {"input": "2 1\n    1 2", "output": "1"}]