import sys
input = sys.stdin.readline


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():
    n, m = map(int, input().split())
    abl = []
    for _ in range(m):
        a,b = map(int, input().split())
        abl.append([a,b])

    uf = UnionFind(n)
    ans_r = []
    curr_ans_minus = 0
    for ab in reversed(abl):
        a,b = ab
        if not uf.same(a-1,b-1): 
            a_size = uf.size(a-1)
            b_size = uf.size(b-1)
            curr_ans_minus += (a_size+b_size)*(a_size+b_size-1)//2
            curr_ans_minus -= (a_size*(a_size-1)//2 + b_size*(b_size-1)//2)
            uf.union(a-1,b-1)
        ans_r.append(curr_ans_minus)


    all_sum = n*(n-1)//2
    for v in reversed(ans_r[:-1]):
        print(all_sum-v)
    print(all_sum)

if __name__ == "__main__":
    main() import sys sys input = sys.stdin.readline input sys.stdin.readline sys.stdin sys stdin readline 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():
    n, m = map(int, input().split())
    abl = []
    for _ in range(m):
        a,b = map(int, input().split())
        abl.append([a,b])

    uf = UnionFind(n)
    ans_r = []
    curr_ans_minus = 0
    for ab in reversed(abl):
        a,b = ab
        if not uf.same(a-1,b-1): 
            a_size = uf.size(a-1)
            b_size = uf.size(b-1)
            curr_ans_minus += (a_size+b_size)*(a_size+b_size-1)//2
            curr_ans_minus -= (a_size*(a_size-1)//2 + b_size*(b_size-1)//2)
            uf.union(a-1,b-1)
        ans_r.append(curr_ans_minus)


    all_sum = n*(n-1)//2
    for v in reversed(ans_r[:-1]):
        print(all_sum-v)
    print(all_sum) main n, m = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m abl = [] abl [] for _ in range(m):
        a,b = map(int, input().split())
        abl.append([a,b])

     _ range(m) range m a,b = map(int, input().split()) a map(int, input().split()) map int input().split() ().split () input split b abl.append([a,b]) abl.append abl append [a,b] a b uf = UnionFind(n) uf UnionFind(n) UnionFind n ans_r = [] ans_r [] curr_ans_minus = 0 curr_ans_minus 0 for ab in reversed(abl):
        a,b = ab
        if not uf.same(a-1,b-1): 
            a_size = uf.size(a-1)
            b_size = uf.size(b-1)
            curr_ans_minus += (a_size+b_size)*(a_size+b_size-1)//2
            curr_ans_minus -= (a_size*(a_size-1)//2 + b_size*(b_size-1)//2)
            uf.union(a-1,b-1)
        ans_r.append(curr_ans_minus)


     ab reversed(abl) reversed abl a,b = ab a ab b if not uf.same(a-1,b-1): 
            a_size = uf.size(a-1)
            b_size = uf.size(b-1)
            curr_ans_minus += (a_size+b_size)*(a_size+b_size-1)//2
            curr_ans_minus -= (a_size*(a_size-1)//2 + b_size*(b_size-1)//2)
            uf.union(a-1,b-1)
         not uf.same(a-1,b-1) uf.same(a-1,b-1) uf.same uf same a-1 a 1 b-1 b 1 a_size = uf.size(a-1) a_size uf.size(a-1) uf.size uf size a-1 a 1 b_size = uf.size(b-1) b_size uf.size(b-1) uf.size uf size b-1 b 1 curr_ans_minus += (a_size+b_size)*(a_size+b_size-1)//2 curr_ans_minus (a_size+b_size)*(a_size+b_size-1)//2 (a_size+b_size)*(a_size+b_size-1) a_size+b_size a_size b_size a_size+b_size-1 a_size+b_size a_size b_size 1 2 curr_ans_minus -= (a_size*(a_size-1)//2 + b_size*(b_size-1)//2) curr_ans_minus a_size*(a_size-1)//2 + b_size*(b_size-1)//2 a_size*(a_size-1)//2 a_size*(a_size-1) a_size a_size-1 a_size 1 2 b_size*(b_size-1)//2 b_size*(b_size-1) b_size b_size-1 b_size 1 2 uf.union(a-1,b-1) uf.union uf union a-1 a 1 b-1 b 1 ans_r.append(curr_ans_minus) ans_r.append ans_r append curr_ans_minus all_sum = n*(n-1)//2 all_sum n*(n-1)//2 n*(n-1) n n-1 n 1 2 for v in reversed(ans_r[:-1]):
        print(all_sum-v)
     v reversed(ans_r[:-1]) reversed ans_r[:-1] ans_r :-1 -1 print(all_sum-v) print all_sum-v all_sum v print(all_sum) print all_sum if __name__ == "__main__":
    main() __name__ == "__main__" __name__ "__main__" 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 input = sys.stdin.readline sys.stdin.readline input def main():
    n, m = map(int, input().split())
    abl = []
    for _ in range(m):
        a,b = map(int, input().split())
        abl.append([a,b])

    uf = UnionFind(n)
    ans_r = []
    curr_ans_minus = 0
    for ab in reversed(abl):
        a,b = ab
        if not uf.same(a-1,b-1): 
            a_size = uf.size(a-1)
            b_size = uf.size(b-1)
            curr_ans_minus += (a_size+b_size)*(a_size+b_size-1)//2
            curr_ans_minus -= (a_size*(a_size-1)//2 + b_size*(b_size-1)//2)
            uf.union(a-1,b-1)
        ans_r.append(curr_ans_minus)


    all_sum = n*(n-1)//2
    for v in reversed(ans_r[:-1]):
        print(all_sum-v)
    print(all_sum) def main():
    n, m = map(int, input().split())
    abl = []
    for _ in range(m):
        a,b = map(int, input().split())
        abl.append([a,b])

    uf = UnionFind(n)
    ans_r = []
    curr_ans_minus = 0
    for ab in reversed(abl):
        a,b = ab
        if not uf.same(a-1,b-1): 
            a_size = uf.size(a-1)
            b_size = uf.size(b-1)
            curr_ans_minus += (a_size+b_size)*(a_size+b_size-1)//2
            curr_ans_minus -= (a_size*(a_size-1)//2 + b_size*(b_size-1)//2)
            uf.union(a-1,b-1)
        ans_r.append(curr_ans_minus)


    all_sum = n*(n-1)//2
    for v in reversed(ans_r[:-1]):
        print(all_sum-v)
    print(all_sum) main
import sys
input = sys.stdin.readline


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():
    n, m = map(int, input().split())
    abl = []
    for _ in range(m):
        a,b = map(int, input().split())
        abl.append([a,b])

    uf = UnionFind(n)
    ans_r = []
    curr_ans_minus = 0
    for ab in reversed(abl):
        a,b = ab
        if not uf.same(a-1,b-1): 
            a_size = uf.size(a-1)
            b_size = uf.size(b-1)
            curr_ans_minus += (a_size+b_size)*(a_size+b_size-1)//2
            curr_ans_minus -= (a_size*(a_size-1)//2 + b_size*(b_size-1)//2)
            uf.union(a-1,b-1)
        ans_r.append(curr_ans_minus)


    all_sum = n*(n-1)//2
    for v in reversed(ans_r[:-1]):
        print(all_sum-v)
    print(all_sum)

if __name__ == "__main__":
    main()