#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int nx=1e5+5;
int n, m, a, b, dsu[nx];
ll res, sz[nx];
set<int> nd[nx], in[nx], ind[nx], outnd[nx];
int find(int x)
{
if (dsu[x]==x) return x;
return dsu[x]=find(dsu[x]);
}
void addedge(int a, int b);
void merge(int a, int b)
{
//cout<<"merge "<<a<<' '<<b<<'\n';
res-=sz[a]*(sz[a]-1);
res-=sz[b]*(sz[b]-1);
//cout<<"debug "<<sz[a]<<' '<<sz[b]<<'\n';
//cout<<"bufore "<<res<<'\n';
vector<pair<int, int>> edg;
for (auto u:nd[b])
{
for (auto v:outnd[u])
{
res-=sz[v];
//cout<<"removeout "<<u<<' '<<v<<'\n';
ind[v].erase(u);
if (in[v].find(find(u))!=in[v].end()) in[v].erase(find(u));
edg.push_back({u, v});
}
outnd[u].clear();
}
for (auto v:ind[b])
{
//cout<<"removein "<<b<<' '<<v<<'\n';
res-=sz[b];
if (ind[a].find(v)!=ind[a].end()) ind[a].erase(v), res-=sz[a];
outnd[v].erase(b);
edg.push_back({v, b});
}
in[b].clear();
ind[b].clear();
dsu[b]=a;
sz[a]+=sz[b];
res+=sz[a]*(sz[a]-1);
for (auto x:nd[b]) nd[a].insert(x);
nd[b].clear();
for (auto [u, v]:edg) addedge(u, v);
}
void addedge(int a, int b)
{
int pa=find(a), pb=find(b);
if (pa==pb||ind[pb].find(a)!=ind[pb].end()) return;
if (in[pa].find(pb)!=in[pa].end()) merge(pa, pb);
else
{
outnd[a].insert(pb);
ind[pb].insert(a);
res+=sz[pb];
in[pb].insert(pa);
}
}
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>m;
for (int i=1; i<=n; i++) dsu[i]=i, sz[i]=1, nd[i].insert(i);
while (m--)
{
cin>>a>>b, addedge(a, b), cout<<res<<'\n';
}
}
/*
3 3
1 2
2 3
3 2
*/
