#include<bits/stdc++.h>
#define l(p) t[p].ls
#define r(p) t[p].rs
using namespace std;
const int N=2.5e5+5,P=13331,inf=0x3f3f3f3f;
typedef unsigned long long ull;
int n,m;
ull ans[N];
//选出两条树边
struct Node{
    int ls,rs;
    ull tag;
}t[N*80];
int rt[N],tot;
ull pw[N];
void change(int &p,int q,int l,int r,int l1,int r1,ull v){
    if(l1>r1)return;
    p=++tot;t[p]=t[q];
    if(l1<=l&&r<=r1){
        // puts("ZDVSAA");
        t[p].tag+=v;
        return;
    }int mid=l+r>>1;
    if(l1<=mid)change(l(p),l(q),l,mid,l1,r1,v);
    if(r1>mid)change(r(p),r(q),mid+1,r,l1,r1,v);
}
ull query(int p,int l,int r,int k,ull tg){
    tg+=t[p].tag;
    if(l==r||!p)return tg;
    int mid=l+r>>1;
    if(k<=mid)return query(l(p),l,mid,k,tg);
    else return query(r(p),mid+1,r,k,tg);
}
int LCP(int x,int y){
    int l=0,r=m,ans=0;
    while(l<=r){
        int mid=l+r>>1;
        if(query(rt[mid],1,n,x,0)==query(rt[mid],1,n,y,0)){
            ans=mid;
            l=mid+1;
        }else r=mid-1;
    }
    return ans;
}
struct OP{
    int l,r;
}q[N];
bool cmp(int x,int y){
    int lcp=LCP(x,y);
    if(lcp==m)return 0;
    return q[lcp+1].l<=y&&y<=q[lcp+1].r;
}
//选出一条树边和一条非树边
int minn[N<<2][2],cnt[N<<2][2],tag[N<<2];
void pushup(int p){
    int mn=min(minn[p<<1][0],minn[p<<1|1][0]),se=inf;
    for(int i=0;i<2;i++)for(int j=0;j<2;j++)
        if(minn[p<<1|i][j]!=mn)se=min(se,minn[p<<1|i][j]);
    minn[p][0]=mn;minn[p][1]=se;
    cnt[p][0]=cnt[p][1]=0;
    for(int i=0;i<2;i++)for(int j=0;j<2;j++){
        if(minn[p<<1|i][j]==mn)cnt[p][0]+=cnt[p<<1|i][j];
        if(minn[p<<1|i][j]==se)cnt[p][1]+=cnt[p<<1|i][j];
    }
}
void upd(int p,int v){
    tag[p]+=v;
    minn[p][0]+=v;
    minn[p][1]+=v;
}
void pushdown(int p){
    if(tag[p]){
        upd(p<<1,tag[p]);
        upd(p<<1|1,tag[p]);
        tag[p]=0;
    }
}
void build(int p,int l,int r){
    tag[p]=0;
    if(l==r){
        minn[p][0]=0;minn[p][1]=inf;
        cnt[p][0]=1;cnt[p][1]=0;
        return;
    }int mid=l+r>>1;
    build(p<<1,l,mid);
    build(p<<1|1,mid+1,r);
    pushup(p);
}
void change(int p,int l,int r,int l1,int r1){
    if(l1>r1)return;
    if(l1<=l&&r<=r1){
        upd(p,1);
        return;
    }int mid=l+r>>1;pushdown(p);
    if(l1<=mid)change(p<<1,l,mid,l1,r1);
    if(r1>mid)change(p<<1|1,mid+1,r,l1,r1);
    pushup(p);
}
ull query(int i){//i为非树边的数量
    ull cnt0=0,cnt1=0;
    if(minn[1][0]==0)cnt0+=cnt[1][0];
    if(minn[1][0]==1)cnt1+=cnt[1][0];
    if(minn[1][1]==1)cnt1+=cnt[1][1];
    // printf("CNT0/1:%d/%d\n",cnt0,cnt1);
    return cnt0*(n-cnt0+i)+cnt1;
}
int id[N];
struct DSU{
    int fa[N],siz[N];
    ull ans;
    void init(int n){
        for(int i=1;i<=n;i++)fa[i]=i,siz[i]=1;
        ans=0;
    }
    int find(int x){
        return fa[x]==x?x:fa[x]=find(fa[x]);
    }
    void merge(int x,int y){
        x=find(x);y=find(y);
        if(x==y)return;
        if(siz[x]<siz[y])swap(x,y);
        ans-=siz[x]*(siz[x]-1)/2;ans-=siz[y]*(siz[y]-1)/2;
        fa[y]=x;siz[x]+=siz[y];
        ans+=siz[x]*(siz[x]-1)/2;
    }
}dsu;
struct op{
    int pos,val;
}p[N];
bool operator<(op x,op y){
    return x.val>y.val;
}
bool FLAG;
int solve(){
    scanf("%d%d",&n,&m);tot=0;n--;
    for(int i=1;i<=n;i++)id[i]=i;
    for(int i=1;i<=m;i++){
        scanf("%d%d",&q[i].l,&q[i].r);
        if(q[i].l>q[i].r)swap(q[i].l,q[i].r);
        q[i].r--;
    }
    build(1,1,n);dsu.init(n);
    for(int i=1;i<=m;i++)change(rt[i],rt[i-1],1,n,q[i].l,q[i].r,pw[i-1]);
    sort(id+1,id+n+1,cmp);
    for(int i=1;i<=m;i++){
        change(1,1,n,q[i].l,q[i].r);
        ans[i]=query(i);
    }
    if(!FLAG){
        for(int i=1;i<n;i++)p[i].pos=i,p[i].val=LCP(id[i],id[i+1]);
        sort(p+1,p+n);
        for(int i=m,cur=1;i>=1;i--){
            while(cur<n&&p[cur].val==i){
                dsu.merge(p[cur].pos,p[cur].pos+1);
                cur++;
            }
            ans[i]+=dsu.ans;
        }
        for(int i=1;i<=m;i++)printf("%llu\n",ans[i]);
    }
    return 0;
}
int main(){
    pw[0]=1;
    for(int i=1;i<=N-5;i++)pw[i]=pw[i-1]*P;
    int t;scanf("%d",&t);if(t!=3)FLAG=1;
    while(t--)solve();
    return 0;
}