import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val numCases = nextInt() val cc = CombinationCalculator() fun catalan(n: Long): ModInt { return cc.binom(2 * n, n) / ModInt(n + 1) } case@ for (_i in 0 until numCases) { val a = nextLong() val b = nextLong() val c = nextLong() val d = nextLong() if (a != b) { println(0) } else { var x = catalan(a + d) for (i in 1..d) { x = cc.binom(2 * a + 2 * d - i, i) * catalan(a + d - i) - x } println(cc.binom(a + b + c + d, c) * x) } } } // region ModInt class ModInt(x: Long) { companion object { const val MOD = 1000000007L //const val MOD = 998244353L } constructor(y: Int) : this(y.toLong()) val x = (x % MOD + MOD) % MOD operator fun plus(other: ModInt): ModInt { return ModInt(x + other.x) } operator fun minus(other: ModInt): ModInt { return ModInt(x - other.x) } operator fun times(other: ModInt): ModInt { return ModInt(x * other.x) } operator fun div(other: ModInt): ModInt { return this * other.inv() } fun pow(exp: Long): ModInt { if (exp == 0L) return ModInt(1L) var a = pow(exp shr 1) a *= a if (exp and 1L == 0L) return a return this * a } fun inv(): ModInt { return this.pow(MOD - 2) } override fun equals(other: Any?): Boolean { if (this === other) return true if (javaClass != other?.javaClass) return false other as ModInt if (x != other.x) return false return true } override fun hashCode(): Int { return x.hashCode() } override fun toString(): String { return "$x" } } fun Long.toModInt(): ModInt { return ModInt(this) } fun Int.toModInt(): ModInt { return ModInt(this) } fun binomSimple(n: Long, k: Long): ModInt { var numer = ModInt(1) var denom = ModInt(1) for (i in 0 until k) { numer *= ModInt(n - i) denom *= ModInt(k - i) } return numer / denom } // endregion class CombinationCalculator { companion object { private const val fac_size = 600000 } private val arrFac = Array(fac_size) { ModInt(1) } private val arrInvfac = Array(fac_size) { ModInt(1) } init { for (i in 1 until fac_size) { arrFac[i] = arrFac[i - 1] * ModInt(i) } arrInvfac[fac_size - 1] = arrFac[fac_size - 1].inv() for (i in fac_size - 2 downTo 1) { arrInvfac[i] = arrInvfac[i + 1] * ModInt(i + 1) } } fun fac(n: Int): ModInt { return arrFac[n] } fun fac(n: Long): ModInt { return fac(n.toInt()) } fun invfac(n: Int): ModInt { return arrInvfac[n] } fun invfac(n: Long): ModInt { return invfac(n.toInt()) } fun binom(n: Long, k: Long): ModInt { return if (k in 0..n) { arrFac[n.toInt()] * arrInvfac[k.toInt()] * arrInvfac[(n - k).toInt()] } else { ModInt(0) } } } fun main() { val writer = PrintWriter(System.out, false) writer.solve() writer.flush() } // region Scanner private var st = StringTokenizer("") private val br = System.`in`.bufferedReader() fun next(): String { while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine()) return st.nextToken() } fun nextInt() = next().toInt() fun nextLong() = next().toLong() fun nextLine() = br.readLine() fun nextDouble() = next().toDouble() // endregion