N,M=list(map(int,input().split()))

edge=[list(map(int,input().split())) for _ in range(M)]



current=N*(N-1)//2

ret=[0]*M



par=list(range(N+1))

cnt=[1]*(N+1)

rank=[0]*(N+1)



def find(x):

    if x==par[x]:

        return x

    else:

        par[x]=find(par[x])

        return par[x]



def same(x,y):

    return find(x)==find(y)



def size(x):

    return cnt[find(x)]



def unite(x,y):

    x=find(x)

    y=find(y)



    if x==y:

        return 0

    

    if rank[x]<rank[y]:

        cnt[y]+=size(x)

        par[x]=y

    else:

        cnt[x]+=size(y)

        par[y]=x

        if rank[x]==rank[y]:rank[x]+=1





for i in range(M-1,-1,-1):

    ret[i]=current



    a,b=edge[i]



    if not same(a,b):

        current-=size(a)*size(b)

        unite(a,b)



for r in ret:

    print(r)
n,m=list(map(int,input().split()))

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

ans=[]



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



uf=UnionFind(n)

ans=[n*(n-1)//2]

while len(edge)>1:

    a,b=edge.pop()

    a-=1

    b-=1

    if uf.same(a,b):

        s=ans[-1]

    else:

        s=ans[-1]-uf.size(a)*uf.size(b)



    uf.union(a,b)

    ans.append(s)



while ans:

    print((ans.pop()))

N, M = list(map(int, input().split()))
edge = [list(map(int, input().split())) for _ in range(M)]
current = N * (N - 1) // 2
ret = [0] * M
par = list(range(N + 1))
cnt = [1] * (N + 1)
rank = [0] * (N + 1)


def find(x):
    if x == par[x]:
        return x
    else:
        par[x] = find(par[x])
        return par[x]


def same(x, y):
    return find(x) == find(y)


def size(x):
    return cnt[find(x)]


def unite(x, y):
    x = find(x)
    y = find(y)
    if x == y:
        return 0
    if rank[x] < rank[y]:
        cnt[y] += size(x)
        par[x] = y
    else:
        cnt[x] += size(y)
        par[y] = x
        if rank[x] == rank[y]:
            rank[x] += 1


for i in range(M - 1, -1, -1):
    ret[i] = current
    a, b = edge[i]
    if not same(a, b):
        current -= size(a) * size(b)
        unite(a, b)
for r in ret:
    print(r)

n, m = list(map(int, input().split()))
edge = [list(map(int, input().split())) for _ in range(m)]
ans = []


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


uf = UnionFind(n)
ans = [n * (n - 1) // 2]
while len(edge) > 1:
    a, b = edge.pop()
    a -= 1
    b -= 1
    if uf.same(a, b):
        s = ans[-1]
    else:
        s = ans[-1] - uf.size(a) * uf.size(b)
    uf.union(a, b)
    ans.append(s)
while ans:
    print((ans.pop()))

-N, M = list(map(int, input().split())) -edge = [list(map(int, input().split())) for _ in range(M)] -current = N * (N - 1) // 2 -ret = [0] * M -par = list(range(N + 1)) -cnt = [1] * (N + 1) -rank = [0] * (N + 1) +n, m = list(map(int, input().split())) +edge = [list(map(int, input().split())) for _ in range(m)] +ans = [] -def find(x): -    if x == par[x]: -        return x -    else: -        par[x] = find(par[x]) -        return par[x] +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()) -def same(x, y): -    return find(x) == find(y) - - -def size(x): -    return cnt[find(x)] - - -def unite(x, y): -    x = find(x) -    y = find(y) -    if x == y: -        return 0 -    if rank[x] < rank[y]: -        cnt[y] += size(x) -        par[x] = y +uf = UnionFind(n) +ans = [n * (n - 1) // 2] +while len(edge) > 1: +    a, b = edge.pop() +    a -= 1 +    b -= 1 +    if uf.same(a, b): +        s = ans[-1] -        cnt[x] += size(y) -        par[y] = x -        if rank[x] == rank[y]: -            rank[x] += 1 - - -for i in range(M - 1, -1, -1): -    ret[i] = current -    a, b = edge[i] -    if not same(a, b): -        current -= size(a) * size(b) -        unite(a, b) -for r in ret: -    print(r) +        s = ans[-1] - uf.size(a) * uf.size(b) +    uf.union(a, b) +    ans.append(s) +while ans: +    print((ans.pop()))