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()))

ab=[list(map(int,input().split())) for i in range(m)]



ans=[]

ans.append(n*(n-1)//2)

uf=UnionFind(n)

for a,b in ab[::-1]:

  if not uf.same(a-1,b-1):

    sizea=uf.size(a-1)

    sizeb=uf.size(b-1)

    ans.append(ans[-1]-sizea*sizeb)

  else:

    ans.append(ans[-1])

  uf.union(a-1,b-1)



for i in ans[::-1][1:]:

  print(i)

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()))

ab = []

uf = UnionFind(n+1)

for i in range(m):

    a,b = list(map(int, input().split()))

    ab.append((a,b))



ans = []

huben = n*(n-1)//2

for a,b in ab[::-1]:

    ans.append(huben)

    if not uf.same(a,b):

        huben -= uf.size(a)*uf.size(b)

        uf.union(a,b)

    

for aa in ans[::-1]:

    print(aa)
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()))
ab = [list(map(int, input().split())) for i in range(m)]
ans = []
ans.append(n * (n - 1) // 2)
uf = UnionFind(n)
for a, b in ab[::-1]:
    if not uf.same(a - 1, b - 1):
        sizea = uf.size(a - 1)
        sizeb = uf.size(b - 1)
        ans.append(ans[-1] - sizea * sizeb)
    else:
        ans.append(ans[-1])
    uf.union(a - 1, b - 1)
for i in ans[::-1][1:]:
    print(i)

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()))
ab = []
uf = UnionFind(n + 1)
for i in range(m):
    a, b = list(map(int, input().split()))
    ab.append((a, b))
ans = []
huben = n * (n - 1) // 2
for a, b in ab[::-1]:
    ans.append(huben)
    if not uf.same(a, b):
        huben -= uf.size(a) * uf.size(b)
        uf.union(a, b)
for aa in ans[::-1]:
    print(aa)

-ab = [list(map(int, input().split())) for i in range(m)] +ab = [] +uf = UnionFind(n + 1) +for i in range(m): +    a, b = list(map(int, input().split())) +    ab.append((a, b)) -ans.append(n * (n - 1) // 2) -uf = UnionFind(n) +huben = n * (n - 1) // 2 -    if not uf.same(a - 1, b - 1): -        sizea = uf.size(a - 1) -        sizeb = uf.size(b - 1) -        ans.append(ans[-1] - sizea * sizeb) -    else: -        ans.append(ans[-1]) -    uf.union(a - 1, b - 1) -for i in ans[::-1][1:]: -    print(i) +    ans.append(huben) +    if not uf.same(a, b): +        huben -= uf.size(a) * uf.size(b) +        uf.union(a, b) +for aa in ans[::-1]: +    print(aa)