#include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se second
using namespace std; using Int = int64_t; using II = pair<Int, Int>;
template <class T> using V = vector<T>; template <class T> using VV = V<V<T>>; template <class T> using VVV = V<VV<T>>;
template <class T = int> inline bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <class T = int> inline bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template <class T> ostream& operator<<(ostream &s, vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }
template <class T> ostream& operator<<(ostream &s, vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n"); return s; }
template <class T, class S> ostream& operator<<(ostream &s, pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }
template <class T, class S> ostream& operator<<(ostream& s, map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
#ifdef _MY_DEBUG
  #define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";
#else
  #define dump(...)
#endif
void dump_func() { cerr << endl; }
template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }
struct Fast { Fast() { cin.tie(0); ios::sync_with_stdio(false); } } fast;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
constexpr int MOD = 1000000007;

struct UnionFind {
  int cnt; // 集合の数
  vector<int> number; // 0以上のとき親のindex, 負のときは集合サイズ
  vector<int> data1, data2; // 連結成分ごとのデータ
  UnionFind(int n) : cnt(n), number(n, -1) {}
  UnionFind(const vector<int>& data1, const vector<int>& data2) :
    cnt(data1.size()), number(data1.size(), -1), data1(data1), data2(data2) {}
  int root(int x) {
    return number[x] < 0 ? x : number[x] = root(number[x]);
  }
  void unite(int x, int y) {
    x = root(x); y = root(y);
    if (x == y) return;
    if (number[y] < number[x]) swap(x, y);
    // yをxにマージ
    number[x] += number[y];
    number[y] = x;
    // // dataのマージ方法に合わせて変える
    // data1[x] += data1[y];
    // data2[x] += data2[y];
    cnt--;
  }
  bool is_same(int x, int y) { return root(x) == root(y); }
  int size(int x) { return -number[root(x)]; }
  int& ref1(int x) { return data1[root(x)]; }
  int& ref2(int x) { return data2[root(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]--;
  }
  V<Int> ans(m + 1);
  UnionFind uf(n);
  for (Int i = m - 1; i >= 0; i--) {
    ans[i] = ans[i + 1];
    if (!uf.is_same(a[i], b[i])) {
      ans[i] += uf.size(a[i]) * uf.size(b[i]);
      uf.unite(a[i], b[i]);
    }
  }
  REPI (i, 1, m + 1) {
    cout << n * (n - 1) / 2 - ans[i] << endl;
  }
}


Measured memory_bytes: 4096