#include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)),UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a+mod-b)%mod
#define MUL(a, b) a = (((a)%mod) * ((b)%mod)) % mod
#define rollcall cout << "I'm Sucu." << endl;
#define repi(i,m,n) for(int i = m;i < n;i++)
#define drep(i,n,m) for(int i = n;i >= m;i--)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) repi(i,1,n+1)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(), v.rend()
#define dmp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define fi first
#define se second
// debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
  os << "(" << p.first << "," << p.second << ")";return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
  for (auto it = v.begin();it != v.end();++it){
    if(it != v.begin())os << " ";os << *it;
  }return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp){
  for(auto x: mp)os << "(" << x.first << "," << x.second << ")" << endl;
  return os;
}
template<typename T, int SIZE>
int array_length(const T (&)[SIZE]){return SIZE;}
template<typename T, int N>
void PRINTF(const T (&a)[N], int s = N, int t = -1, bool f = true){
	if(t == -1){rep(i,s){if(i)cout << " ";cout << a[i];}}
	else repi(i,s,t){if(i!=s)cout << " ";cout << a[i];}
	if(f)cout << "\n";
}
template<typename T, int N1, int N2>
void PRINTF(const T (&a)[N1][N2], int h = N1, int w = N2){
	rep(i,h){rep(j,w){cout << a[i][j] << " \n"[j==w-1];}}
}
string substr(const string &str, int S1, int S2 = -1){
  if(S2 == -1)return str.substr(S1);
  return str.substr(S1, S2-S1);
}
// typedef
typedef complex<double> Point;
typedef pair<int, int> P;
typedef pair<int, P> PP;
typedef pair<P, int> Pi;
typedef vector<int> vi;
typedef deque<int> dq;
const int inf = 1e9+7;
const int INF = 1e18+7;
// int sum = accumulate(a, a+n, 0LL);
// int mx = max_element(a, a+n);
// int mn = min_element(a, a+n);
// int cnt = count(a, a+n, k);

class UnionFind{
public:
	vector<int> ran, par, cnt;
	void init(int n){
		for(int i = 0;i < n;i++){
			par.push_back(i);
			ran.push_back(0);
			cnt.push_back(1);
		}
	}
	
	int find(int x){
		if(par[x] == x)return x;
		return par[x] = find(par[x]);
	}
	
	void unite(int x, int y){
		x = find(par[x]);
		y = find(par[y]);
		if(x == y)return;
		if(ran[x] < ran[y]){
			par[x] = y;
      cnt[y] += cnt[x];
		}else{
			par[y] = x;
			if(par[x] == par[y])ran[x]++;
      cnt[x] += cnt[y];
		}
	}
  
  int num(int x){
    return cnt[find(x)];
  }
	
	bool same(int x, int y){
		return find(par[x]) == find(par[y]);
	}
};

vector<int> ans;
vector<P> G;
signed main(){
  int n, m;
  cin >> n >> m;
  rep(i,m){
    int x, y;cin >> x >> y;
    G.push_back(P(x, y));
  }
  reverse(all(G));
  UnionFind uf;uf.init(n+1);
  
  // cout << endl;
  // uf.unite(1, 2);uf.unite(0, 2);
  // rep(i,n)cout << uf.num(i) << " ";cout << endl;
  // rep(i,m)cout << G[i].fi << " " << G[i].se << endl;
  int cnt = n*(n-1)/2;ans.pb(cnt);
  rep(i,m-1){
    int x = G[i].fi, y = G[i].se;
    if(uf.same(x, y)){ans.pb(cnt);continue;}
    cnt -= uf.num(x) * uf.num(y);
    uf.unite(x, y);
    ans.pb(cnt);
  }
  reverse(all(ans));
  rep(i,m)cout << ans[i] << endl;
  return 0;
}






Measured memory_bytes: 7280