import sys
readline = sys.stdin.readline

n = 404040
mod = 10 ** 9 + 7

fact = [1] * (n + 1)
inv = [1] * (n + 1)
for i in range(1, n):
    fact[i + 1] = ((i+1) * fact[i]) % mod
inv[n] = pow(fact[n], mod - 2, mod)
for i in range(n - 1, -1, -1):
    inv[i] = inv[i + 1] * (i + 1) % mod

def comb(n, r):
    if n < 0 or r < 0 or n - r < 0:
        return 0
    return fact[n] * inv[r] * inv[n - r] % mod

T = int(readline())
for _ in range(T):
    H, W = map(int, readline().split())
    print(2 * (H + W - 3) * comb(H + W - 4 , H - 2) % mod)