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

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 -1, -1

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

        return x, y

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


bridge = [(map(int, input().split())) for _ in range(M)][::-1]

unionfind = UnionFind(N)
total = N * (N - 1) // 2
ans = [total]
roots = set()
size = [0] * (N + 1)
not_fuben = 0
for a, b in bridge[:-1]:
    x, y = unionfind.union(a - 1, b - 1)
    if x != -1:
        if x not in roots:
            roots.add(x)
            size[x] = 2
            not_fuben += 1
        else:
            if y in roots:
                not_fuben += size[y] * size[x]
                size[x] += size[y]
            else:
               not_fuben += size[x]
               size[x] += 1
    ans.append(total - not_fuben)
for a in ans[::-1]:
    print(a) N, M = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split M 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 -1, -1

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

        return x, y

    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()} 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 -1, -1

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

        return x, y

     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 -1, -1

         x == y x y return -1, -1 return -1, -1 -1 -1 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 return x, y return x, y x y 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 (map(int, input().split())) for _ in range(M) for _ in range(M) _ range(M) range M for _ in range(M) map(int, input().split()) map int input().split() ().split () input split bridge = [(map(int, input().split())) for _ in range(M)][::-1] bridge [(map(int, input().split())) for _ in range(M)][::-1] [(map(int, input().split())) for _ in range(M)] ::-1 -1 unionfind = UnionFind(N) unionfind UnionFind(N) UnionFind N total = N * (N - 1) // 2 total N * (N - 1) // 2 N * (N - 1) N N - 1 N 1 2 ans = [total] ans [total] total roots = set() roots set() set size = [0] * (N + 1) size [0] * (N + 1) [0] 0 N + 1 N 1 not_fuben = 0 not_fuben 0 for a, b in bridge[:-1]:
    x, y = unionfind.union(a - 1, b - 1)
    if x != -1:
        if x not in roots:
            roots.add(x)
            size[x] = 2
            not_fuben += 1
        else:
            if y in roots:
                not_fuben += size[y] * size[x]
                size[x] += size[y]
            else:
               not_fuben += size[x]
               size[x] += 1
    ans.append(total - not_fuben) a b bridge[:-1] bridge :-1 -1 x, y = unionfind.union(a - 1, b - 1) x unionfind.union(a - 1, b - 1) unionfind.union unionfind union a - 1 a 1 b - 1 b 1 y if x != -1:
        if x not in roots:
            roots.add(x)
            size[x] = 2
            not_fuben += 1
        else:
            if y in roots:
                not_fuben += size[y] * size[x]
                size[x] += size[y]
            else:
               not_fuben += size[x]
               size[x] += 1
     x != -1 x -1 if x not in roots:
            roots.add(x)
            size[x] = 2
            not_fuben += 1
        else:
            if y in roots:
                not_fuben += size[y] * size[x]
                size[x] += size[y]
            else:
               not_fuben += size[x]
               size[x] += 1
     x not in roots x roots roots.add(x) roots.add roots add x size[x] = 2 size[x] size x 2 not_fuben += 1 not_fuben 1 if y in roots:
                not_fuben += size[y] * size[x]
                size[x] += size[y]
            else:
               not_fuben += size[x]
               size[x] += 1
     y in roots y roots not_fuben += size[y] * size[x] not_fuben size[y] * size[x] size[y] size y size[x] size x size[x] += size[y] size[x] size x size[y] size y not_fuben += size[x] not_fuben size[x] size x size[x] += 1 size[x] size x 1 ans.append(total - not_fuben) ans.append ans append total - not_fuben total not_fuben for a in ans[::-1]:
    print(a) a ans[::-1] ans ::-1 -1 print(a) print a unionfind = UnionFind(N) UnionFind(N) unionfind size = [0] * (N + 1) [0] * (N + 1) size not_fuben += 1 1 not_fuben bridge = [(map(int, input().split())) for _ in range(M)][::-1] [(map(int, input().split())) for _ in range(M)][::-1] bridge N, M = map(int, input().split()) map(int, input().split()) N total = N * (N - 1) // 2 N * (N - 1) // 2 total not_fuben += size[y] * size[x] size[y] * size[x] not_fuben not_fuben = 0 0 not_fuben not_fuben += size[x] size[x] not_fuben ans = [total] [total] ans roots = set() set() roots x, y = unionfind.union(a - 1, b - 1) unionfind.union(a - 1, b - 1) x M = map(int, input().split()) map(int, input().split()) M y = unionfind.union(a - 1, b - 1) unionfind.union(a - 1, b - 1) y 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 -1, -1

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

        return x, y

    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()} 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 -1, -1

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

        return x, y

    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()} UnionFind
N, M = map(int, input().split())

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 -1, -1

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

        return x, y

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


bridge = [(map(int, input().split())) for _ in range(M)][::-1]

unionfind = UnionFind(N)
total = N * (N - 1) // 2
ans = [total]
roots = set()
size = [0] * (N + 1)
not_fuben = 0
for a, b in bridge[:-1]:
    x, y = unionfind.union(a - 1, b - 1)
    if x != -1:
        if x not in roots:
            roots.add(x)
            size[x] = 2
            not_fuben += 1
        else:
            if y in roots:
                not_fuben += size[y] * size[x]
                size[x] += size[y]
            else:
               not_fuben += size[x]
               size[x] += 1
    ans.append(total - not_fuben)
for a in ans[::-1]:
    print(a)