#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)
#define ABS(x) max((x),-(x))

template <typename TYPE>
class UnionFindTree
{
private:
    std::vector<TYPE> parent_;
    std::vector<TYPE> rank_;
    std::vector<TYPE> size_;
    size_t find(size_t i)
    {
        assert(i < parent_.size());
        size_t j = (size_t)parent_[i];
        if (i != j)
        {
            j = find(j);
            parent_[i] = (TYPE)j;
        }
        return j;
    }

public:
    UnionFindTree(size_t n)
        : parent_(n), rank_(n, (TYPE)0), size_(n, (TYPE)1)
    {
        for (size_t i(0); i < n; ++i)
        {
            parent_[i] = (TYPE)i;
        }
    }
    ~UnionFindTree()
    {
        ;
    }
    void
    unite(size_t i,
          size_t j)
    {
        assert(i < parent_.size());
        assert(j < parent_.size());
        i = find(i);
        j = find(j);
        if (i == j)
            return;
        if (rank_[i] < rank_[j])
            std::swap<size_t>(i, j);
        parent_[j] = (TYPE)i;
        if (rank_[i] == rank_[j])
            rank_[i]++;
        size_[i] += size_[j];
    }
    bool
    same(size_t i,
         size_t j)
    {
        assert(i < parent_.size());
        assert(j < parent_.size());
        return find(i) == find(j);
    }
    TYPE
    size(size_t i)
    {
        assert(i < parent_.size());
        i = find(i);
        return size_[i];
    }
};

int main()
{
    size_t N, M;
    cin >> N >> M;

    size_t ans[M];
    ans[M - 1] = N * (N - 1) / 2;

    if (M > 1){
        size_t A[M], B[M];
        rep(i, M){cin >> A[i] >> B[i];}
        UnionFindTree<size_t> tree(N);
        for(int i = M - 1; i > 0; --i){
            ans[i - 1] = ans[i];
            if (!tree.same(A[i] - 1, B[i] - 1)){
                ans[i - 1] -= tree.size(A[i] - 1) * tree.size(B[i] - 1);
                tree.unite(A[i] - 1, B[i] - 1);
            }
        }
    }
    rep(i, M){cout << ans[i] << endl;}
}


Measured memory_bytes: 4992