Untitled

Text Views: 23 • Oct 27, 2026 • Never expires
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=998244353;
const int MAXN=2000005;
int T,n,m,a,b,c,d,total;
int fac[MAXN],inv[MAXN];

int qpow(int a,int b){
	int res=1;
	while(b){
		if(b&1)
			res=res*a%mod;
		a=a*a%mod,
		b>>=1;
	}
	return res;
}

void pre(){
	fac[0]=1;
	for(int i=1;i<MAXN;i++)
		fac[i]=fac[i-1]*i%mod;
	inv[MAXN-1]=qpow(fac[MAXN-1],mod-2);
	for(int i=MAXN-2;i>=0;i--)
		inv[i]=inv[i+1]*(i+1)%mod;
}

int C(int n,int m){
	if(m<0||m>n)
		return 0;
	return fac[n]*inv[m]%mod*inv[n-m]%mod;
}

signed main(){
	freopen("Jinhsi.in","r",stdin);
	freopen("Jinhsi.out","w",stdout);
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);//用这个加速cin和cout,不得使用scanf、getchar、printf或putchar
	pre();
	cin>>T;
	while(T--){
		cin>>n>>m>>a>>b>>c>>d;
		// 特判 1x1 的矩形,内部没有网格线段,概率为 1
		if(c-a==1&&d-b==1){
			cout<<1<<'\n';
			continue;
		}
		
		total=C(n+m,n);
		
		// S1: 路径完全在右下方 (x=c 时 y <= b)
		int s1=total;
		for(int x=0;x<=c-1;x++){
			s1=(s1-C(x+b,x)*C(n-x+m-b-1,n-x)%mod+mod)%mod;
		}
		
		// S2: 路径完全在左上方 (y=d 时 x <= a)
		int s2=total;
		for(int y=0;y<=d-1;y++){
			s2=(s2-C(y+a,a)*C(n-a-1+m-y,m-y)%mod+mod)%mod;
		}
		
		int ans=(s1+s2)%mod;
		cout<<ans*qpow(total,mod-2)%mod<<'\n';
	}
	return 0;
}