Untitled
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int p=998244353;
int n,m,a,b,c,d;
int qpow(int x,int y){
int ans=1,base=x;
while(y>0){
if(y&1){
ans=(base%p)*(ans%p)%p;
}
base=(base%p)*(base%p)%p;
y>>=1;
}
ans%=p;
return ans;
}
int x[1010],y[1010],z[1010];
void solve(){
cin>>n>>m>>a>>b>>c>>d;
int sum=0;
int base=1;
for(int i=1;i<=n;i++) base=(base*(m+i)/i)%p;
x[0]=y[0]=z[0]=1;
for(int i=1;i<=n;i++){
x[i]=(x[i-1]%p*(b+i)/i)%p;
if(d-b-2<0) y[i]=0;
else y[i]=(y[i-1]%p*(d-b-2+i)/i)%p;
z[i]=(z[i-1]%p*(m-d+i)/i)%p;
}
for(int i=0;i<=a;i++){
for(int j=a+1;j<=n;j++){
sum=(sum+(x[i]%p*y[j-i]%p)%p*z[n-j]%p)%p;
}
}
for(int i=a+1;i<c;i++){
for(int j=i;j<=n;j++){
sum=(sum+(x[i]%p*y[j-i]%p)%p*z[n-j]%p)%p;
}
}
cout<<((base-sum)%p+p)*qpow(base,p-2)%p<<endl;
}
signed main(){
freopen("1-1.in ","r",stdin);
freopen("Jinhsi.ans","w",stdout);
cin.tie(0)->sync_with_stdio(0);
int _;
cin>>_;
while(_--) solve();
}
Featured
Advertisement
Category
Action