local mod = 1000000007 local mfl = math.floor local function bmul(x, y) local x1, y1 = mfl(x / 31623), mfl(y / 31623) local x0, y0 = x - x1 * 31623, y - y1 * 31623 return (x1 * y1 * 14122 + (x1 * y0 + x0 * y1) * 31623 + x0 * y0) % mod end local function badd(x, y) return (x + y) % mod end local function bsub(x, y) return x < y and x - y + mod or x - y end local function modpow(src, pow) local res = 1 while 0 < pow do if pow % 2 == 1 then res = bmul(res, src) pow = pow - 1 end src = bmul(src, src) pow = mfl(pow / 2) end return res end local function modinv(src) return modpow(src, mod - 2) end local fact = {1} local invs = {1} local invfact = {1} for i = 2, 400010 do fact[i] = bmul(fact[i - 1], i) invs[i] = bmul(mfl(mod / i), mod - invs[mod % i]) invfact[i] = bmul(invfact[i - 1], invs[i]) end local function getComb(n, k) if k == 0 or k == n then return 1 end return bmul(fact[n], bmul(invfact[k], invfact[n - k])) end local q = io.read("*n") for iq = 1, q do local h, w = io.read("*n", "*n") if h == 1 or w == 1 then print(0) else local v = getComb(h + w - 4, h - 2) v = bmul(2 * v, h + w - 3) print(v) end end