using System;
using System.Collections.Generic;
using System.Linq;
using static System.Console;
using static System.Convert;
using static System.Math;
//using static System.Globalization.CultureInfo;

class Program
{
    static void Main(string[] args)
    {
        var nm = Add.ar;
        var res = new long[nm[1]];
        var ct = (long)nm[0] * (nm[0] - 1) / 2;
        res[nm[1] - 1] = ct;
        var ad = new int[nm[1]][];
        for(var i = 0; i < nm[1]; i++)
        {
            var inp = Add.ar;
            ad[i] = inp;
        }
        var un = new UnionFind<int>();
        for (var i = 0; i < nm[0]; i++)
            un.MakeSet(i + 1);
        for(var i = nm[1]-2; i >= 0; i--)
        {
            if (un.IsSame(ad[i + 1][1], ad[i + 1][0]))
            {
                res[i] = res[i + 1];
                continue;
            }
            var d0 = un.Rank(ad[i + 1][0]);
            var d1 = un.Rank(ad[i + 1][1]);
            un.Union(ad[i + 1][1], ad[i + 1][0]);
            res[i] = res[i + 1] - (long)d0 * d1;
        }
        WriteLine(string.Join("\n", res));
    }
}

public class Add
{
    public static string read => ReadLine();
    public  static int[] ar => Array.ConvertAll(read.Split(' '), int.Parse);
    public  static int num => ToInt32(read);
    public  static long[] arL => Array.ConvertAll(read.Split(' '), long.Parse);
    public  static long numL => ToInt64(read);
    public  const string Alfa = "abcdefghijklmnopqrstuvwxyz";
    public  const int MOD = 1000000007;
}

public class UnionFind<T>
{
    private class Vertex
    {
        public T Key { get; set; }
        public Vertex Parent { get; set; }
        public int Rank { get; set; }
        public int ct { get; set; }
        public Vertex(T key) : this(key, null, 0)
        {

        }
        public Vertex(T key, Vertex Parent, int rank)
        {
            this.Key = key;
            this.Parent = Parent;
            this.Rank = rank;
            ct = 1;
        }
    }
    private readonly Dictionary<T, Vertex> dics;
    private readonly Vertex NIL;

    public int Count { get; private set; }

    public UnionFind()
    {
        NIL = new Vertex(default(T));
        dics = new Dictionary<T, Vertex>();
    }
    
    public T parent(T key)
        => FindSet(dics[key].Parent).Key;

    public int Rank(T key)
        => FindSet(dics[key].Parent).ct;

    public bool IsSame(T key1, T key2)
    {
        if (!dics.ContainsKey(key1) || !dics.ContainsKey(key2))
            throw new ArgumentException("対応する頂点が存在しません");
        return ReferenceEquals(FindSet(dics[key1]),FindSet(dics[key2]));
    }

    public bool MakeSet(T key)
    {
        if (dics.ContainsKey(key))
            throw new ArgumentException($"{key}をキーとして持つ頂点が既に存在します");
        dics[key] = new Vertex(key, NIL, 0);
        dics[key].Parent = dics[key];
        Count++;
        return true;
    }

    public bool Union(T key1, T key2)
    {
        if (!dics.ContainsKey(key1) || !dics.ContainsKey(key2))
            throw new ArgumentException("対応する頂点が存在しません");
        if (IsSame(key1, key2)) return false;
        Link(FindSet(dics[key1]), FindSet(dics[key2]));
        Count--;
        return true;
    }

    private bool Link(Vertex vex1, Vertex vex2)
    {
        if (vex1.Rank > vex2.Rank)
        {
            vex1.ct += vex2.ct;
            vex2.Parent = vex1;
        }
        else
        {
            vex2.ct += vex1.ct;
            vex1.Parent = vex2;
            if (vex1.Rank == vex2.Rank)
                vex2.Rank++;
        }
        return true;
    }

    private Vertex FindSet(Vertex vex)
    {
        if (!ReferenceEquals(vex.Parent, vex))
            vex.Parent = FindSet(vex.Parent);
        return vex.Parent;
    }
}


Measured memory_bytes: 39776