#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long modpow(long long a, long long b){
	long long ans = 1;
	while (b > 0){
		if (b % 2 == 1){
			ans *= a;
			ans %= MOD;
		}
		a *= a;
		a %= MOD;
		b /= 2;
	}
	return ans;
}
long long modinv(long long a){
	return modpow(a, MOD - 2);
}
vector<long long> mf = {1};
vector<long long> mfi = {1};
long long modfact(int n){
	if (mf.size() > n){
		return mf[n];
	} else {
		for (int i = mf.size(); i <= n; i++){
			long long next = mf.back() * i % MOD;
			mf.push_back(next);
			mfi.push_back(modinv(next));
		}
		return mf[n];
	}
}
long long modfactinv(int n){
	if (mfi.size() > n){
		return mfi[n];
	} else {
		return modinv(modfact(n));
	}
}
long long modbinom(int n, int k){
	if (n < 0 || k < 0 || k > n){
		return 0;
	} else {
		return modfact(n) * modfactinv(k) % MOD * modfactinv(n - k) % MOD;
	}
}
int main(){
  int T;
  cin >> T;
  for (int i = 0; i < T; i++){
    int A, B, C, D;
    cin >> A >> B >> C >> D;
    if (A != B){
      cout << 0 << endl;
    } else if (A == 0){
      if (D > 0){
        cout << 0 << endl;
      } else {
        cout << 1 << endl;
      }
    } else {
      long long ans1 = modfact(A * 2 + D - 1) * modfactinv(A - 1) % MOD;
      ans1 *= modinv(A + D);
      ans1 %= MOD;
      ans1 *= modfactinv(D);
      ans1 %= MOD;
      ans1 *= modfactinv(A - 1);
      ans1 %= MOD;
      long long ans2 = 0;
      if (A > 1){
        ans2 = modfact(A * 2 + D - 1) * modfactinv(A - 2) % MOD;
        ans2 *= modinv(A + D + 1);
        ans2 %= MOD;
        ans2 *= modfactinv(D);
        ans2 %= MOD;
        ans2 *= modfactinv(A);
        ans2 %= MOD;
      }
      long long ans = (ans1 % MOD - ans2 % MOD + MOD) % MOD;
      ans %= MOD;
      ans *= modbinom(A * 2 + C + D, C);
      ans %= MOD;
      cout << ans << endl;
    }
  }
}