#include <bits/stdc++.h>

using namespace std;
 
const int BUFF_SIZE = 1 << 20;
char BUFF[BUFF_SIZE], *BB, *BE;
char gc() {
  return BB == BE ? (BE = (BB = BUFF) + fread(BUFF, 1, BUFF_SIZE, stdin), BB == BE ? EOF : *BB++) : *BB++;
}
void read() {}
template<class T, class ...Ts>
void read(T &x, Ts &...args) {
  x = 0;
  char ch = 0, w = 0;
  while (ch < '0' || ch > '9')
    w |= ch == '-', ch = gc();
  while (ch >= '0' && ch <= '9')
    x = x * 10 + (ch ^ '0'), ch = gc();
  if (w) x = -x;
  read(args...);
}

using ll = long long;

const int N = 1e5;
const int M = 3e5;

int n, m;
vector<int> vec, e[N + 5];
int id[N + 5], low[N + 5], dfnTot, st[N + 5], top, bel[N + 5];
bool inStack[N + 5];
void clear() {
  for (int u: vec)
    e[u].clear(), id[u] = bel[u] = 0;
  vec.clear();
}
void addEdge(int u, int v) { vec.push_back(u), vec.push_back(v), e[u].push_back(v); }
void dfs(int u) {
  int &tot = dfnTot;
  id[u] = low[u] = ++tot, st[++top] = u, inStack[u] = 1;
  for (int v: e[u])
    if (!id[v]) dfs(v), low[u] = min(low[u], low[v]);
    else if (inStack[v]) low[u] = min(low[u], id[v]);
  if (id[u] == low[u]) {
    for (; st[top] != u; --top)
      inStack[st[top]] = 0, bel[st[top]] = u;
    inStack[u] = 0, bel[u] = u, --top;
  }
}
void tarjan() {
  dfnTot = 0;
  for (int u: vec)
    if (!id[u]) dfs(u);
}
tuple<int, int, int> g[M + 5];
void solve(int l, int r, int L, int R)
{
  if (l == r || L > R) return;
  int mid = (l + r) >> 1;
  int Mid = R;
  for (int i = R; i >= L; --i)
    if (get<2>(g[i]) > mid)
      swap(g[Mid--], g[i]);
  clear();
  for (int i = L; i <= Mid; ++i) addEdge(get<0>(g[i]), get<1>(g[i]));
  tarjan();
  for (int i = Mid; i >= L; --i)
    if (bel[get<0>(g[i])] != bel[get<1>(g[i])] || !bel[get<0>(g[i])])
      get<2>(g[i]) = mid + 1, swap(g[Mid--], g[i]);
  for (int i = Mid + 1; i <= R; ++i) {
    int u, v, id; tie(u, v, id) = g[i];
    if (bel[u]) u = bel[u];
    if (bel[v]) v = bel[v];
    g[i] = make_tuple(u, v, id);
  }
  solve(l, mid, L, Mid), solve(mid + 1, r, Mid + 1, R);
}

ll ans;

struct UnionFind {
  int fa[N + 5], siz[N + 5];
  void init(int n) {
    for (int i = 1; i <= n; ++i) siz[i] = 1;
  }
  bool isRoot(int x) { return !fa[x]; }
  int find(int x) { return isRoot(x) ? x : fa[x] = find(fa[x]); }
  void merge(int x, int y) {
    int fx = find(x), fy = find(y);
    if (fx != fy)
      ans += (ll)siz[fx] * siz[fy],
      fa[fy] = fx, siz[fx] += siz[fy];
  }
} uf;

int main() {
  //freopen("graph.in", "r", stdin), freopen("graph.out", "w", stdout);
  read(n, m);
  for (int i = 1; i <= m; ++i) {
    int u, v; read(u, v);
    g[i] = make_tuple(u, v, i);
  }
  solve(0, m + 1, 1, m);
  uf.init(n);
  for (int i = 1, j = 1; i <= m; ++i) {
    for (; j <= m && get<2>(g[j]) <= i; ++j)
      uf.merge(get<0>(g[j]), get<1>(g[j]));
    printf("%lld\n", ans);
  }
}