#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m;
const int M=1e6+10;
int logg[M];
    vector<int>id(M,-1);
void log22(int n){
    for(int i=2;i<=n;i++){
        logg[i]=logg[i/2]+1;
    }
}
void solve () {

    cin>>n>>m;
    vector<vector<int>>g(n+1);
    vector<vector<int>>e(n+1);
    map<pair<int,int>,int>mp;
    for(int i=1;i<=m;i++){
        int u,v;
        cin>>u>>v;
        if(u==v)continue;
        if(mp[{u,v}]||mp[{v,u}])continue;
        mp[{u,v}]=mp[{v,u}]=1;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    vector<int>ip(n+1,-1);
    vector<pair<int,int>>a;
    a.push_back({0,0});
    for(int i=1;i<=n;i++){
        sort(g[i].begin(),g[i].end());
        // if(g[i].size()){
        //     a.push_back({g[i].back(),i});
        //     ip[i]=a.size()-1;
        // }
        for(auto v:g[i]){
            e[v].push_back(i);
            a.push_back({g[i].back(),i});
            id[(int)a.size()-1]=i;
        }
        if(g[i].size())
            ip[i]=a.size()-1;
    }
    for(int i=1;i<=n;i++){
        sort(e[i].begin(),e[i].end());
    }
    int cnt=0;
    const int N=a.size()+10;
    vector<vector<int>>fa(N,vector<int>(30,0));
    for(int i=1;i<N;i++)fa[i][0]=a[i].first;
    for(int i=1;i<=22;i++){
        for(int j=1;j+(1<<i)-1<=n;j++){
            fa[j][i]=max(fa[j][i-1],fa[j+(1<<(i-1))][i-1]);
        }
    }
    auto f=[&](int l,int r)->int{
        {}
        int s=logg[r-l+1];
        return max(fa[l][s],fa[r-(1<<s)+1][s]);
    };
    // int cnt=0;
    // for(auto [x,y]:a)cerr<<x<<" ";
    // for(int i=1;i<=4;i++)cerr<<id[i]<<" ";cerr<<endl;
    int st=0;
    for(int i=2;i<=n;i++){
        st=max(st,ip[i-1]);
        if(mp[{i-1,i}]==1) continue;
        else if(ip[i]==-1||g[i].size()==0){
            ip[i]=st;
            cnt++;
        }else {
            auto check=[&](int x,int r)->bool{
                {}
                return f(x,r)<=i;
            };
            int l=1,r=ip[i-1];
            // cerr<<i<<" "<<l<<" "<<r<<endl;
            if(l>r){
                cnt++;
                continue;
            }
            while(l<r){
                int mid=l+r>>1;
                if(check(mid,r))r=mid;
                else l=mid+1;
            }
            // if(i==4)cerr<<l<<" ";
            int L=id[l],R=id[ip[i-1]];
            if(id[l]==id[l-1]){
                if(L==R){
                    cnt++;
                    continue;
                }
                L++;
            }
            // cerr<<L<<" "<<R<<endl;
            int k=lower_bound(e[i].begin(),e[i].end(),L)-e[i].begin();
            if(e[i][k]<=R);
            else cnt++;
        }

    // cerr<<"8";
    }
    for(int i=0;i<=N;i++)id[i]=-1;
    cout<<cnt<<endl;
}
signed main () {
    int T = 1; 
    std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cin>>T;
    log22(1e6);
    while (T --) solve ();
    return 0;
}