#pragma region header
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr int inf = INT32_MAX/2;
constexpr ll INF = LLONG_MAX/2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */

/* --------------------テンプレート------------------ */
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
/* ----------------------end----------------------- */

/* --------------------ライブラリ-------------------- */
ll fact(int i) {       //階乗
    if (i == 0) return 1;
    return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {        //最大公約数
    if(b == 0) return a;
    return gcd(b, a % b); 
}
ll lcm(ll a, ll b) {      //最小公倍数
    return a * b / gcd(a, b);
}
int keta(ll n) {        //桁数を求める
    if(n == 0) return 1;
    int count = 0;
    while(n != 0) {
        n /= 10;
        count++;
    }
    return count;
}
ll ketasum(ll n) {    //各桁の和
    ll sum = 0;
    while(n != 0) {
        sum += n % 10;
        n /= 10;
    }
    return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
struct UnionFind {
    vector<int> par, size;
    UnionFind(int x) {
        par.resize(x);
        size.resize(x, 1);
        for(int i = 0; i < x; i++) {
            par[i] = i;
        }
    }
    int find(int x) {
        if (par[x] == x)
            return x;
        return par[x] = find(par[x]);
    }
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    int consize(int x) {
        return size[find(x)];
    }
    void unite(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y)
            return;
        if (size[x] < size[y]) {
            par[x] = y;
            size[y] += size[x];
        }
         else {
            par[y] = x;
            size[x] += size[y];
        }
    }
};
signed main() {
    int n,m;cin >> n >> m;
    vvi v(m,vi(2));
    rep(i, m){
        cin >> v[i][0] >> v[i][1];
        v[i][0]--;v[i][1]--;
    }
    int k = n*(n-1)/2;
    UnionFind uf(n);
    set<int> st;
    int count = k;
    vi ans(m);
    map<int,int> mp;
    rev(i, m) {
        int s = st.size();
        ans[i]=count;
        bool ok = false;
        int mo1 = mp[uf.find(v[i][0])],mo2=mp[uf.find(v[i][1])];
        if(uf.same(v[i][0],v[i][1])) ok = true;
        else uf.unite(v[i][0],v[i][1]);
        st.insert(uf.find(v[i][0]));
        if(st.size()==s) {
            //count=k-(uf.consize(v[i][0])*(uf.consize(v[i][0])-1)/2);
            int mo = mp[uf.find(v[i][0])];
            mp[uf.find(v[i][0])]=uf.consize(v[i][0])*(uf.consize(v[i][0])-1)/2;
            if(!ok) count-=mp[uf.find(v[i][0])]-(mo1+mo2);
            else continue;
            // cout << i +1 << "if" << endl;
        }
        else {
            mp[uf.find(v[i][0])]=uf.consize(v[i][0])*(uf.consize(v[i][0])-1)/2;
            count-=mp[uf.find(v[i][0])];
            // cout << i+1 << "else" << endl;
        }
    }
    for(auto p:ans)cout << p << endl;
    return 0;
}

Measured memory_bytes: 18748