#include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define RFORE(i,a,b) for(int i=(b);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define SZ(c) (int)((c).size())
#define EACH(i,v) for(auto i=v.begin();i!=v.end();++i)
#define REACH(i,v) for(auto i=v.rbegin();i!=v.rend();++i)
#define LB(c,x) distance((c).begin(),lower_bound(ALL(c),x))
#define UB(c,x) distance((c).begin(),upper_bound(ALL(c),x))
#define COUNT(c,x) (upper_bound(ALL(c),x)-lower_bound(ALL(c),x))
#define UNIQUE(c) SORT(c); (c).erase(unique(ALL(c)),(c).end());
#define COPY(c1,c2) copy(ALL(c1),(c2).begin())
#define EXIST(s,e) (bool)((s).find(e)!=(s).end())
#define PB push_back
#define MP make_pair
#define DUMP(x)  cerr<<#x<<" = "<<(x)<<endl;
#define NL cerr<<endl;
using namespace std;
template<typename T,typename U> using P=pair<T,U>;
template<typename T> using V=vector<T>;
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T sum(vector<T>&v){return accumulate(ALL(v),T());}
template<typename T>T sum(vector<T>&v,int a,int b){return accumulate(v.begin()+a,v.begin()+b,T());}
template<typename T>T max(vector<T>&v){return *max_element(ALL(v));}
template<typename T>T min(vector<T>&v){return *min_element(ALL(v));}
template<typename T>T max_index(vector<T>&v){return distance((v).begin(),max_element(ALL(v)));}
template<typename T>T min_index(vector<T>&v){return distance((v).begin(),min_element(ALL(v)));}

struct edge { int to, cost; };

template<typename T>auto&operator<<(ostream&s,const vector<T>&v){s<<"[";bool a=1;for(auto e:v){s<<(a?"":" ")<<e;a=0;}s<<"]";return s;}
template<typename T,typename U>auto&operator<<(ostream&s,const pair<T,U>&p){s<<"("<<p.first<<","<<p.second<<")";return s;}
template<typename T>auto&operator<<(ostream&s,const set<T>&st){s<<"{";bool a=1;for(auto e:st){s<<(a?"":" ")<<e;a=0;}s<<"}";return s;}
template<typename T,typename U>auto&operator<<(ostream&s,const map<T,U>&m){s<<"{";bool a=1;for(auto e:m){s<<(a?"":" ")<<e.first<<":"<<e.second;a=0;}s<<"}";return s;}

const int INF = 1e18;
const int MOD_N = 1e9+7;

struct UnionFind
{
   vector<int> par, myrank, sz;
   UnionFind(int n) {
      par.resize(n);
      myrank.resize(n, 0);
      sz.resize(n, 1);
      for (int i = 0; i < n; i++) {
         par[i] = i;
      }
   }
   int find(int x) {
      if (par[x] == x) return x;
      return par[x] = find(par[x]);
   }
   void unite(int x, int y) {
      x = find(x);
      y = find(y);
      if (x == y) return;
      if (myrank[x] < myrank[y]) {
         par[x] = y;
         sz[y] += sz[x];
      } else {
         par[y] = x;
         sz[x] += sz[y];
         if(myrank[x] == myrank[y]) myrank[x]++;
      }
   }
   bool same(int x, int y) {
      return find(x) == find(y);
   }
   int size(int x) {
      return sz[find(x)];
   }
};

signed main()
{
   int n, m; cin >> n >> m;
   V<int> a(m), b(m);
   REP(i, m) {
      cin >> a[i] >> b[i];
      a[i]--; b[i]--;
   }

   UnionFind uf(n);
   int s = n * (n-1) / 2;
   V<int> ans;
   RREP(i, m) {
      ans.push_back(s);
      if (!uf.same(a[i], b[i])) {
         int na = uf.size(a[i]), nb = uf.size(b[i]);
         s += na * (na-1) / 2 + nb * (nb-1) / 2;
         s -= (na+nb) * (na+nb-1) / 2;
      }
      uf.unite(a[i], b[i]);
   }

   RREP(i, m) {
      cout << ans[i] << endl;
   }

   return 0;
}


Measured memory_bytes: 6132