#include<bits/stdc++.h>
using namespace std;
constexpr int M=4005,mod=998244353;
int n,m,l[M],r[M],mn[M][M],mx[M][M];
struct info{int p,q;
    bool operator <(const info &a) const
        {return 1ll*p*a.q<1ll*a.p*q;}
}ans;
int tot,a[M];
int qpow(int x,int n){
    int s=1; while (n){
        if (n&1) s=1ll*s*x%mod;
        x=1ll*x*x%mod; n>>=1;
    } return s;
}
int test,TT;
void solve(){
    test++;
    cin>>n>>m;ans={1,1};tot=0;
    for (int i=1;i<=m;i++) cin>>l[i]>>r[i],a[++tot]=l[i],a[++tot]=r[i];
    if(test==30&&TT==250){
        cout<<n<<" "<<m<<"\n";
        for (int i=1;i<=m;i++)
        cout<<l[i]<<" "<<r[i]<<"\n";
        exit(0);
    }
    sort(a+1,a+tot+1);
    tot=unique(a+1,a+tot+1)-a-1;
    for (int i=1;i<=m;i++)
    l[i]=lower_bound(a+1,a+tot+1,l[i])-a,
    r[i]=lower_bound(a+1,a+tot+1,r[i])-a;
    n=tot;
    // cout<<tot<<"******\n";
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++)
            mn[i][j]=0x3f3f3f3f,mx[i][j]=0;
    for (int i=1;i<=m;i++) mn[l[i]][r[i]]=1,mx[l[i]][r[i]]=1;
    for (int l=n;l;l--)
        for (int r=l;r<=n;r++)
            for (int k=l;k<r;k++){
                // if (!mx[l][k]||!mx[k+1][r]) continue;
                 if(a[k]+1==a[k+1])
                mn[l][r]=min(mn[l][r],mn[l][k]+mn[k+1][r]);//,cout<<l<<" "<<r<<" "<<k<<" "<<a[k]<<"\n";
                mx[l][r]=max(mx[l][r],mx[l][k]+mx[k+1][r]);
            }
    for (int i=1;i<=n;i++)
        for (int j=i;j<=n;j++)
            if (mx[i][j])
                // cerr<<i<<"~"<<j<<":"<<mx[i][j]<<":"<<mn[i][j]<<"\n",
            ans=max(ans,{mx[i][j],mn[i][j]});
    cout<<1ll*ans.p*qpow(ans.q,mod-2)%mod<<'\n';
}
int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int T;cin>>T;TT=T;
    while (T--) solve();return 0;
}