#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii ;
typedef pair<ll, ll> pll ;
typedef vector<pii> vii ;
typedef vector<int> veci ;
typedef vector<pll> vll ;
typedef vector<ll> vecll;
// find_by_order order_of_key
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define Mp make_pair
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define set_dec(x) cout << fixed << setprecision(x);
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb lower_bound
#define ub upper_bound
#define for1(n) for(int i=1;i<=n;i++)
#define for0(n) for(int i=0;i<n;i++)
#define forn(n) for(int i=n;i>0;i--)
#define pq priority_queue <pii, vector<pii>, greater<pii>>
const int N=1e5+10;
int n,m,par[N],sz[N];
ll ans;
vector<pii>vec;
set<int>g[N],g1[N],is[N];
inline int get_par(int v){
return (par[v]==0 ? v:par[v]=get_par(par[v]));
}
void ad(int u,int v){
if(g[u].find(v)!=g[u].end())return;
g[u].insert(v);
g1[v].insert(u);
if(g[v].find(u)!=g[v].end())vec.pb({u,v});
}
void merg(int u,int v){
u=get_par(u);
v=get_par(v);
if(u==v)return;
if(g[u].size()+g1[u].size()+is[u].size()>g[v].size()+g1[v].size()+is[v].size())swap(u,v);
ans+=1ll*is[u].size()*sz[v]+1ll*is[v].size()*sz[u];
par[u]=v;
sz[v]+=sz[u];
for(int uu:is[u]){
if(is[v].find(uu)==is[v].end())is[v].insert(uu);
else ans-=sz[v];
}
g[u].erase(v);g1[v].erase(u);
g[v].erase(u);g1[u].erase(v);
for(int uu:g[u]){
g1[uu].erase(u);
ad(v,uu);
}
for(int uu:g1[u]){
g[u].erase(uu);
ad(uu,v);
}
g[u].clear();g1[u].clear();is[u].clear();
}
int main(){
fast_io
cin>>n>>m;
for1(n){
is[i].insert(i);
sz[i]=1;
}
while(m--){
int u,v;cin>>u>>v;v=get_par(v);
if(is[v].find(u)!=is[v].end() || get_par(u)==v){cout<<ans<<endl;continue;}
is[v].insert(u);
ans+=sz[v];
u=get_par(u);
ad(u,v);
while(vec.size()){
int u=vec.back().F,v=vec.back().S;vec.pop_back();
merg(u,v);
}
cout<<ans<<endl;
}
}
