#include<bits/stdc++.h>
using namespace std;
bool M1;
#define PI 3.14159265358979323846
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
#define int long long
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time cerr << "TIME : " << clock() * 0.001 << "s" <<'\n'
const int N=1e5+5,lg=30,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
return u+rd()%(v-u+1);
}
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,-1,0,1,1,-1,1,-1};
int node,m,a[N],ans,cnt[N];
queue<ii>p;
map<int,int>in[N];
set<ii>s[N];
struct DSU
{
int n;
vector<int>r;
DSU(){};
DSU(int _n):n(_n),r(n+5,-1){};
int acs(int u){
return r[u]<0?u:r[u]=acs(r[u]);
}
void Erase(int u,int v){
ans+=r[v];
s[acs(u)].erase({v,u});
in[v].erase(u);
p.em(u,v);
// cout <<u<<" "<<v<<'\n';
}
void join(int u,int v){
if(cnt[u]>cnt[v])swap(u,v);
while(sz(s[u])){
ii j=*s[u].begin();
Erase(j.se,j.fi);
}
while(sz(in[u])){
Erase(in[u].begin()->fi,u);
}
ans+=r[u]*r[v]*2;
ans+=sz(in[v])*-r[u];
r[v]+=r[u];
r[u]=v;
}
}dsu;
void add(int u,int v){
v=dsu.acs(v);
u=dsu.acs(u);
// cout <<u<<" "<<v<<'\n';
if(dsu.acs(u)==v||in[v][u])return;
// cout <<1<<'\n';
// cout <<u<<" "<<v<<'\n';
in[v][u]=1;
ans+=-dsu.r[v];
s[u].insert({v,u});
++cnt[u];
++cnt[v];
auto it=s[v].lower_bound(make_pair(u,-1));
if(it->fi==u)
dsu.join(u,v);
}
bool M2;
void solve(){
cin >> node >> m;
dsu=DSU(node);
for(int i=1;i<=m;++i){
int u,v;
cin >> u >> v;
p.em(u,v);
while(!p.empty()){
u=p.front().fi;
v=p.front().se;
// cout <<u<<" "<<v<<'\n';
p.pop();
ad#include<bits/stdc++.h>
using namespace std;
bool M1;
#define PI 3.14159265358979323846
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
#define int long long
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time cerr << "TIME : " << clock() * 0.001 << "s" <<'\n'
const int N=1e5+5,lg=30,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
return u+rd()%(v-u+1);
}
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,-1,0,1,1,-1,1,-1};
int node,m,a[N],ans,cnt[N];
queue<ii>p;
map<int,int>in[N];
set<ii>s[N];
struct DSU
{
int n;
vector<int>r;
DSU(){};
DSU(int _n):n(_n),r(n+5,-1){};
int acs(int u){
return r[u]<0?u:r[u]=acs(r[u]);
}
void Erase(int u,int v){
ans+=r[v];
s[acs(u)].erase({v,u});
in[v].erase(u);
p.em(u,v);
// cout <<u<<" "<<v<<'\n';
}
void join(int u,int v){
if(cnt[u]>cnt[v])swap(u,v);
while(sz(s[u])){
ii j=*s[u].begin();
Erase(j.se,j.fi);
}
while(sz(in[u])){
Erase(in[u].begin()->fi,u);
}
ans+=r[u]*r[v]*2;
ans+=sz(in[v])*-r[u];
r[v]+=r[u];
r[u]=v;
}
}dsu;
void add(int u,int v){
v=dsu.acs(v);
u=dsu.acs(u);
// cout <<u<<" "<<v<<'\n';
if(dsu.acs(u)==v||in[v][u])return;
// cout <<1<<'\n';
// cout <<u<<" "<<v<<'\n';
in[v][u]=1;
ans+=-dsu.r[v];
s[u].insert({v,u});
++cnt[u];
++cnt[v];
auto it=s[v].lower_bound(make_pair(u,-1));
if(it->fi==u)
dsu.join(u,v);
}
bool M2;
void solve(){
cin >> node >> m;
dsu=DSU(node);
for(int i=1;i<=m;++i){
int u,v;
cin >> u >> v;
p.em(u,v);
while(!p.empty()){
u=p.front().fi;
v=p.front().se;
// cout <<u<<" "<<v<<'\n';
p.pop();
add(u,v);
}
cout << ans<<'\n';
}
}
main()
{
srand(time(0));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#define task "aws"
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int t=1;
// cin >> t;
while(t--){
solve();
}
look_memory;
look_time;
}d(u,v);
}
cout << ans<<'\n';
}
}
main()
{
srand(time(0));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#define task "aws"
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int t=1;
// cin >> t;
while(t--){
solve();
}
look_memory;
look_time;
}
