#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=4e6+10,mod=998244353;
int fac[N],ifac[N];
ll qpow(ll x,ll y=mod-2){
	ll ans=1;
	for(;y;(x*=x)%=mod,y>>=1)if(y&1)(ans*=x)%=mod;
	return ans;
}
void init(int n=4e6){
	for(int i=fac[0]=1;i<=n;i++)fac[i]=1ll*fac[i-1]*i%mod;
	ifac[n]=qpow(fac[n]);
	for(int i=n;i>=1;i--)ifac[i-1]=1ll*ifac[i]*i%mod;
}
int C(int n,int m){
	if(0>m||m>n)return 0;
	return 1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}
int T,a,b,c,d;
int C(int a,int b,int c){
	return 1ll*C(a+b+c,a)*C(b+c,b)%mod;
}
int calc(int b,int c,int d){
	return C(d-b*2,b,c);
}
void get(){
	scanf("%d%d%d%d",&a,&b,&c,&d);
	int sum=0-2*a-b+c+2*d;
	if(sum<0)swap(a,d),swap(b,c);
	printf("%d\n",int((
		0ll
		+!a*calc(b,c,d)
		+(a-1ll)*(a>1)*calc(b,c-2,d-a)
		+(a+1ll)*calc(b-2,c,d-a-2)
		+2*!!a*calc(b,c-1,d-a)
		+2*calc(b-1,c,d-a-1)
		+2ll*a*!!a*calc(b-1,c-1,d-a-1)
	)%mod));
}
int main(){
	for(init(),scanf("%d",&T);T--;)get();
	return 0;
}