#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define rep(i,x,y) for(register int i=x;i<=y;i++)
#define rep1(i,x,y) for(register int i=x;i>=y;--i)
#define int long long
#define fire signed
#define il inline
template<class T> il void print(T x) {
	if(x<0) printf("-"),x=-x;
	if (x > 9) print(x / 10);
	putchar(x % 10 + '0');
}
const int bufsize = 230005;
char buf[bufsize], *f1, *f2;
#define getchar() (f1 == f2 && (f2 = buf + fread(f1 = buf, 1, bufsize, stdin)) == buf? EOF: *f1++)
template<class T> il void in(T &x) {
    x = 0; char ch = getchar();
    int f = 1;
    while (ch < '0' || ch > '9') {if(ch=='-') f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar(); }
    x *= f;
}
int T,a,b,c,d;
const int N=4e6+10,mod=998244353;
int inv[N],jc[N];
int qmi(int x,int y) {
	int res=1;
	while(y) {
		if(y&1) res=res*x%mod;
		x=x*x%mod;
		y>>=1;
	}return res;
}
int C(int n,int m) {
	if(n<m||n<0||m<0) return false;
	return jc[n]*inv[n-m]%mod*inv[m]%mod;
}
int calc(int x,int y,int z) {
	if(z<2*x) return false;
	return C(y+z-x,x)*C(y+z-2*x,y)%mod;
}
void solve() {
	in(a),in(b),in(c),in(d);
	int now=c+2*(d-a)-b;
	if(now==0) {
		puts("0");
		return;
	}
	if(now<0) {
		swap(a,d);
		swap(b,c);
	}
	int res=0;
	if(a>0) res=(calc(b,c-2,d-a)*(a-1)%mod+calc(b,c-1,d-a)*2)%mod;
	res=(res+calc(b-1,c,d-a-1)*2%mod)%mod;
	if(!a) res=res+calc(b,c,d);
	res=(res+calc(b-2,c,d-a-2)*(a+1)%mod+calc(b-1,c-1,d-a-1)*a*2%mod)%mod;
	cout<<res<<endl;
}
fire main() {
	in(T);
	jc[0]=1,inv[0]=1;
	rep(i,1,4000000) jc[i]=jc[i-1]*i%mod,inv[i]=qmi(jc[i],mod-2);
	while(T--) {
		solve();
	}
	return false;
}