T = int(input())
MOD = 10**9+7

def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod

mod = 10**9+7 #出力の制限
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル

for i in range( 2, N + 1 ):
    g1.append( ( g1[-1] * i ) % mod )
    inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2.append( (g2[-1] * inverse[-1]) % mod )


result = []
for t in range(T):
    A, B, C, D = map(int, input().split())
    N = A+B+C+D
    if A != B:
        result.append(0)
        continue
    ans = cmb(N, C, mod) * cmb(N-C-2, D, mod)
    ans %= MOD
    ans *= cmb(2*(A-1), A-1, mod) * pow(A, mod-2, mod)
    result.append(ans % MOD)
print(*result, sep='\n')