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 main():
    from sys import stdin
    from collections import deque
    input = lambda: stdin.readline()
    N,M = map(int,input().split())
    uf = UnionFind(N+1)
    AB = deque()
    for i in range(M):
        AB.append(map(int,input().split()))
    diff_pairs = [0]*M
    AB.reverse()
    prev = 0
    for i,(a,b) in enumerate(AB):
        if not uf.same(a,b):
            num_a = uf.size(a)
            num_b = uf.size(b)
            prev += num_a * num_b
            uf.union(a,b)
        diff_pairs[M-i-1] = prev
    outputs = deque()
    sum_d = 0
    prev = diff_pairs[0]
    for i in range(1,M):
        sum_d += prev-diff_pairs[i]
        outputs.append(sum_d)
        prev = diff_pairs[i]
    outputs.append(sum_d+1)
    print('\n'.join(map(str,outputs)))



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

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

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

     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

         x == y x y return 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 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 def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots()) __str__ return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots()) '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots()) '\n'.join '\n' join '{}: {}'.format(r, self.members(r)) '{}: {}'.format '{}: {}' format r self.members(r) self.members self members r self self def main():
    from sys import stdin
    from collections import deque
    input = lambda: stdin.readline()
    N,M = map(int,input().split())
    uf = UnionFind(N+1)
    AB = deque()
    for i in range(M):
        AB.append(map(int,input().split()))
    diff_pairs = [0]*M
    AB.reverse()
    prev = 0
    for i,(a,b) in enumerate(AB):
        if not uf.same(a,b):
            num_a = uf.size(a)
            num_b = uf.size(b)
            prev += num_a * num_b
            uf.union(a,b)
        diff_pairs[M-i-1] = prev
    outputs = deque()
    sum_d = 0
    prev = diff_pairs[0]
    for i in range(1,M):
        sum_d += prev-diff_pairs[i]
        outputs.append(sum_d)
        prev = diff_pairs[i]
    outputs.append(sum_d+1)
    print('\n'.join(map(str,outputs))) main from sys import stdin from collections import deque input = lambda: stdin.readline() input lambda: stdin.readline() stdin.readline() stdin.readline stdin readline N,M = map(int,input().split()) N map(int,input().split()) map int input().split() ().split () input split M uf = UnionFind(N+1) uf UnionFind(N+1) UnionFind N+1 N 1 AB = deque() AB deque() deque for i in range(M):
        AB.append(map(int,input().split()))
     i range(M) range M AB.append(map(int,input().split())) AB.append AB append map(int,input().split()) map int input().split() ().split () input split diff_pairs = [0]*M diff_pairs [0]*M [0] 0 M AB.reverse() AB.reverse AB reverse prev = 0 prev 0 for i,(a,b) in enumerate(AB):
        if not uf.same(a,b):
            num_a = uf.size(a)
            num_b = uf.size(b)
            prev += num_a * num_b
            uf.union(a,b)
        diff_pairs[M-i-1] = prev
     i (a,b) a b enumerate(AB) enumerate AB if not uf.same(a,b):
            num_a = uf.size(a)
            num_b = uf.size(b)
            prev += num_a * num_b
            uf.union(a,b)
         not uf.same(a,b) uf.same(a,b) uf.same uf same a b num_a = uf.size(a) num_a uf.size(a) uf.size uf size a num_b = uf.size(b) num_b uf.size(b) uf.size uf size b prev += num_a * num_b prev num_a * num_b num_a num_b uf.union(a,b) uf.union uf union a b diff_pairs[M-i-1] = prev diff_pairs[M-i-1] diff_pairs M-i-1 M-i M i 1 prev outputs = deque() outputs deque() deque sum_d = 0 sum_d 0 prev = diff_pairs[0] prev diff_pairs[0] diff_pairs 0 for i in range(1,M):
        sum_d += prev-diff_pairs[i]
        outputs.append(sum_d)
        prev = diff_pairs[i]
     i range(1,M) range 1 M sum_d += prev-diff_pairs[i] sum_d prev-diff_pairs[i] prev diff_pairs[i] diff_pairs i outputs.append(sum_d) outputs.append outputs append sum_d prev = diff_pairs[i] prev diff_pairs[i] diff_pairs i outputs.append(sum_d+1) outputs.append outputs append sum_d+1 sum_d 1 print('\n'.join(map(str,outputs))) print '\n'.join(map(str,outputs)) '\n'.join '\n' join map(str,outputs) map str outputs main() main 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()) 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()) UnionFind def main():
    from sys import stdin
    from collections import deque
    input = lambda: stdin.readline()
    N,M = map(int,input().split())
    uf = UnionFind(N+1)
    AB = deque()
    for i in range(M):
        AB.append(map(int,input().split()))
    diff_pairs = [0]*M
    AB.reverse()
    prev = 0
    for i,(a,b) in enumerate(AB):
        if not uf.same(a,b):
            num_a = uf.size(a)
            num_b = uf.size(b)
            prev += num_a * num_b
            uf.union(a,b)
        diff_pairs[M-i-1] = prev
    outputs = deque()
    sum_d = 0
    prev = diff_pairs[0]
    for i in range(1,M):
        sum_d += prev-diff_pairs[i]
        outputs.append(sum_d)
        prev = diff_pairs[i]
    outputs.append(sum_d+1)
    print('\n'.join(map(str,outputs))) def main():
    from sys import stdin
    from collections import deque
    input = lambda: stdin.readline()
    N,M = map(int,input().split())
    uf = UnionFind(N+1)
    AB = deque()
    for i in range(M):
        AB.append(map(int,input().split()))
    diff_pairs = [0]*M
    AB.reverse()
    prev = 0
    for i,(a,b) in enumerate(AB):
        if not uf.same(a,b):
            num_a = uf.size(a)
            num_b = uf.size(b)
            prev += num_a * num_b
            uf.union(a,b)
        diff_pairs[M-i-1] = prev
    outputs = deque()
    sum_d = 0
    prev = diff_pairs[0]
    for i in range(1,M):
        sum_d += prev-diff_pairs[i]
        outputs.append(sum_d)
        prev = diff_pairs[i]
    outputs.append(sum_d+1)
    print('\n'.join(map(str,outputs))) main
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 main():
    from sys import stdin
    from collections import deque
    input = lambda: stdin.readline()
    N,M = map(int,input().split())
    uf = UnionFind(N+1)
    AB = deque()
    for i in range(M):
        AB.append(map(int,input().split()))
    diff_pairs = [0]*M
    AB.reverse()
    prev = 0
    for i,(a,b) in enumerate(AB):
        if not uf.same(a,b):
            num_a = uf.size(a)
            num_b = uf.size(b)
            prev += num_a * num_b
            uf.union(a,b)
        diff_pairs[M-i-1] = prev
    outputs = deque()
    sum_d = 0
    prev = diff_pairs[0]
    for i in range(1,M):
        sum_d += prev-diff_pairs[i]
        outputs.append(sum_d)
        prev = diff_pairs[i]
    outputs.append(sum_d+1)
    print('\n'.join(map(str,outputs)))



main()