#include<bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int N = 4e6 + 5; 

char buf[1 << 23], *p1 = buf, *p2 = buf;
#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1 ++)
int read() {
	int s = 0, w = 1; char ch = getchar();
	while(!isdigit(ch)) { if(ch == '-') w = -1; ch = getchar(); }
	while(isdigit(ch)) s = s * 10 + (ch ^ 48), ch = getchar();
	return s * w; 
}
template <typename A>
int mul(A x) { return x; }
template <typename A, typename ... B>
int mul(A x, B ... args) { return 1ll * x * mul(args ...) % mod; }
void inc(int &a, int b) { a = a >= mod - b ? a - mod + b : a + b; }
int add(int a, int b) { return a >= mod - b ? a - mod + b : a + b; }
int ksm(int a, int b) { 
	int res = 1;
	while(b > 0) {
		if(b & 1) res = mul(res, a);
		a = mul(a, a), b >>= 1;
	}
	return res;
}

int fac[N], ifac[N];

int C(int b, int c, int d) {
	if(b < 0 || c < 0 || d < 0) return 0;
	return mul(fac[b + c + d], ifac[b], ifac[c], ifac[d]);
}
int h(int b, int c, int d) {
	d -= 2 * b;
	if(b < 0 || c < 0 || d < 0) return 0;
	return mul(fac[b + c + d], ifac[b], ifac[c], ifac[d]);
}
int g(int a, int b, int c, int d) {
	if(a < 0 || b < 0 || c < 0 || d < 0) return 0;
	if(a) return add(h(b - 1, c, d - a - 1), h(b, c - 1, d - a));
	else return add(h(b, c, d), h(b - 1, c, d - 1));
}

void solve() {
	int a = read(), b = read(), c = read(), d = read();
	int s = -2 * a - b + c + 2 * d;
	if(!s) return printf("0\n"), void();
	if(s < 0) swap(a, d), swap(b, c);
	auto f = [&](int i) {
		if(i == 1) {
			int x = C(b, c - 2, d - a - 2 * b);
			int y = C(b - 2, c, d - a - 2 * b + 2);
			int z = C(b - 1, c - 1, d - a - 2 * b + 1);
			return add(add(x, y), add(z, z));
		} 
		if(!i) return add(g(a, b - 1, c, d - 1), g(a, b, c, d));
		else return add(g(a - i, b, c - 1, d - i), g(a - i, b - 1, c, d - i - 1));
	};
	int lim = min(a, d), ans = f(0);
	if(lim) inc(ans, mul(f(1), lim - 1)), inc(ans, f(lim));
	printf("%d\n", ans);
}

signed main() {
	for(int i = fac[0] = 1; i < N; ++ i) fac[i] = mul(fac[i - 1], i);
	ifac[N - 1] = ksm(fac[N - 1], mod - 2);
	for(int i = N - 2; i >= 0; -- i) ifac[i] = mul(ifac[i + 1], i + 1);

	int T = read();
	while(T --) solve();	
	return 0;
}