#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
const ll mod=998244353;
ll a,b,c,d;
typedef array<ll,3> arin;
const int iu=4e6;
ll f[iu+1];
ll inf[iu+1];
ll pw(ll x,ll y){
	if(y==0) return 1;
	if(y%2) return x*pw(x,y-1)%mod;
	ll res=pw(x,y/2);
	return res*res%mod;
}
ll e(ll a,ll b,ll c){
	if(a<0 || b<0 || c<0) return 0;
	return f[a+b+c]*inf[a]%mod*inf[b]%mod*inf[c]%mod;
}
ll h(ll a,ll b,ll c){//ways to arrange such that start and end is 2
	c-=2*b;
	//cout << "tmp " << a << ' ' << b << ' ' << c << endl;
	if(a<0 || b<0 || c<0) return 0;
	ll ans=(e(a,b,c)-e(a-1,b,c)*2+e(a-2,b,c)+2*mod+(a==1 && b==0 && c==0))%mod;
	//cout << ans << endl;
	return ans;
}
ll g(ll a,ll b,ll c){
	ll calc=(h(a,b,c)+h(a,b-1,c-1)*2+h(a,b-2,c-2))%mod;
	//cout << "G " << a << ' ' << b << ' ' << c << ' ' << calc << endl;
	return calc;
}
arin cal(ll a,ll b,ll c){
	arin res;
	res[0]=h(a,b,c);
	res[1]=h(a,b,c+1)*2%mod;
	res[1]=(res[1]+2*mod-2*res[0])%mod;
	res[2]=h(a,b,c+2);
	res[2]=(res[2]+2*mod-res[1]-res[0])%mod;
	return res;
}
void solve(){
	cin >> a >> b >> c >> d;
	if(b+c==0){
		cout << (a==0 || d==0) << '\n';
		return;
	}
	if(b+c==1){
		cout << (1+(a!=0 || d!=0)) << '\n';
		return;
	}
	if((d-a)*2+(c-b)<0){
		swap(a,d);
		swap(b,c);
	}
	swap(a,d);
	if(a<d){
		cout << "0\n";
		return;
	}
	auto v=cal(c,b,a-d);
	//cout << v[0] << ' ' << v[1] << ' ' << v[2] << endl;
	ll ans=(v[0]*(d==0)+v[1]+v[2]*(d+1))%mod;
	cout << ans << '\n';
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	f[0]=1;
	for(int i=1; i<=iu ;i++){
		f[i]=f[i-1]*i%mod;
	}
	inf[iu]=pw(f[iu],mod-2);
	for(int i=iu; i>=1 ;i--){
		inf[i-1]=inf[i]*i%mod;
	}
	int t;cin >> t;while(t--) solve();
}