#include <bits/stdc++.h>

using LL = long long;

const int N = 4e5 + 7;
const int MOD = 1e9 + 7;

int fac[N], ifc[N], inv[N];

int pow(int x, int y) {
  int ret = 1;
  while(y) {
    if(y & 1)
      ret = 1LL * ret * x % MOD;
    x = 1LL * x * x % MOD;
    y >>= 1;
  }
  return ret;
}

int com(int x, int y) {
  return 1LL * fac[x] * ifc[y] % MOD * ifc[x - y] % MOD;
}

int main() {

  fac[0] = ifc[0] = fac[1] = ifc[1] = inv[1] = 1;
  for(int i = 2; i < N; ++i) {
    fac[i] = 1LL * fac[i - 1] * i % MOD;
    inv[i] = MOD - 1LL * (MOD / i) * inv[MOD % i] % MOD;
    ifc[i] = 1LL * ifc[i - 1] * inv[i] % MOD;
  }

  int cases;
  scanf("%d", &cases);
  
  while(cases--) {
    int a, b, c, d;
    scanf("%d%d%d%d", &a, &b, &c, &d);
    if(a != b)
      puts("0");
    else if(a == 0)
      printf("%d\n", !d);
    else
      printf("%lld\n", 1LL * inv[a] * com(a + b + c + d, c) % MOD *
	     com(a + d - 1, d) % MOD * com(2 * a + d, a - 1) % MOD);
  }
  
  return 0;
}