#include <bits/stdc++.h>
#define s1 first
#define s2 second
using namespace std;
int t,n,m;
int l[2011],r[2011];
pair<int,int*> a[4011];
int mn[4011],mx[4011];
int A,B;
vector<int> v[4011];
const int p=998244353;
inline int qpow(int bs,int ex){int ans=1;while(ex){if(ex&1)ans=1ll*ans*bs%p;ex>>=1;bs=1ll*bs*bs%p;}return ans;}
int main()
{
	scanf("%d",&t);while(t--)
	{
		scanf("%d%d",&n,&m);
		int an=0;
		for(int i=1;i<=m;++i)
		{
			scanf("%d%d",l+i,r+i);
			++an;a[an].s1=l[i],a[an].s2=l+i;
			++an;a[an].s1=r[i],a[an].s2=r+i;
		}
		sort(a+1,a+1+an);a[0].s1=-1e9;
		int k=0;
		for(int i=1;i<=an;++i)k+=a[i].s1!=a[i-1].s1,*a[i].s2=k;
		for(int i=1;i<=k;++i)v[i].clear();
		for(int i=1;i<=m;++i)v[r[i]].push_back(l[i]);
		int A=1,B=1;
		// for(int i=1;i<=m;++i)printf("[%d,%d] ",l[i],r[i]);putchar(10);
		for(int i=1;i<=k;++i)
		{
			// printf("==================i:%d\n",i);
			for(int j=i;j<=k;++j)mx[j]=-1e9,mn[j]=1e9;
			mn[i-1]=0;mx[i-1]=0;
			for(int j=i;j<=k;++j)
			{
				mx[j]=max(mx[j],mx[j-1]);
				for(int l:v[j])if(l>=i)mn[j]=min(mn[j],mn[l-1]+1),mx[j]=max(mx[j],mx[l-1]+1);
			}
			// printf("mx:");for(int j=i;j<=k;++j)printf("%d ",mx[j]);putchar(10);
			// printf("mn:");for(int j=i;j<=k;++j)printf("%d ",mn[j]);putchar(10);
			for(int j=i;j<=k;++j)if(mn[j]<1e9)
			{
				if(1ll*mx[j]*B>1ll*A*mn[j])A=mx[j],B=mn[j];
			}
		}
		printf("%lld\n",1ll*A*qpow(B,p-2)%p);
	}
	fclose(stdin);fclose(stdout);return 0;
}