#include <stdio.h>

const int Mod = 1000000007;
long long fact[400001], fact_inv[400001];

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

long long combination(int n, int k)
{
	return fact[n] * fact_inv[k] % Mod * fact_inv[n-k] % Mod;
}

long long solve(int A, int B, int C, int D)
{
	if (A != B) return 0;
	else if (A == 0) {
		if (D == 0) return 1;
		else return 0;
	} else return div_mod(combination(A + D - 1, D) * combination(A * 2 + D, A - 1) % Mod, A, Mod) * combination(A + B + C + D, C) % Mod;
}

int main()
{
	int i, j, T, A, B, C, D;
	for (i = 1, fact[0] = 1; i <= 400000; i++) fact[i] = fact[i-1] * i % Mod;
	for (i = 399999, fact_inv[400000] = div_mod(1, fact[400000], Mod); i >= 0; i--) fact_inv[i] = fact_inv[i+1] * (i + 1) % Mod;
	scanf("%d", &T);
	for (i = 1; i <= T; i++) {
		scanf("%d %d %d %d", &A, &B, &C, &D);
		printf("%lld\n", solve(A, B, C, D));
	}
	fflush(stdout);
	return 0;
}