mod=10**9+7
def cmb(n,r):
  if r<0 or r>n:
    return 0
  return (g1[n]*g2[r]*g2[n-r])%mod
 
N=1000000
g1=[1]*(N+3)
for i in range(2,N+3):
  g1[i]=g1[i-1]*i%mod
g2=[0]*len(g1)
g2[-1]=pow(g1[-1],mod-2,mod)
for i in range(N+1,-1,-1):
  g2[i]=g2[i+1]*(i+1)%mod
inv=[0]*(N+3)
for i in range(1,N+3):
  inv[i]=g2[i]*g1[i-1]%mod
for t in range(int(input())):
  A,B,C,D=map(int,input().split())
  if A!=B:
    print(0)
    continue
  X=cmb(A+B+C+D,C)
  D+=A+2
  print(X*cmb(D+A-2,A-1)*cmb(D-3,A-1)*pow(A,mod-2,mod)%mod)