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: sn, bn = map(int, input().split(" "))
  fubensa = [int(sn * (sn - 1) / 2)]
  if bn > 1:
      br = []
      for _ in range(bn):
          br.append(list(map(int, input().split(" "))))
      br = br[::-1]
      sg = [0 for n in range(sn + 1)]
      sg[br[0][0]] = 1
      sg[br[0][1]] = 1
      gn = 1
      fubensa.append(fubensa[0] - 1)
      sgc = [0, 2]
  
      for bri in range(1, bn - 1):
          si1 = br[bri][0]
          si2 = br[bri][1]
          sg1 = sg[si1]
          sg2 = sg[si2]
          if sg1 + sg2 == 0:
              gn += 1
              sg[si1], sg[si2] = gn, gn
              sgc.append(2)
              fubensa.append(fubensa[bri] - 1)
          elif sg1 == 0:
              fubensa.append(fubensa[bri] - sgc[sg2])
              sg[si1] = sg2
              sgc[sg2] += 1
          elif sg2 == 0:
              fubensa.append(fubensa[bri] - sgc[sg1])
              sg[si2] = sg1
              sgc[sg1] += 1
          elif sg1 != sg2:
              fubensa.append(fubensa[bri] - sgc[sg1] * sgc[sg2])
              sg = [sg1 if x == sg2 else x for x in sg]
          else:
              fubensa.append(fubensa[bri])
  for x in fubensa[::-1]:
      print(x)
  
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"}]