import sys
import threading

MOD = 10**9 + 7
MAX = 2 * (10**5) + 10

def main():
    import sys
    # sys.setrecursionlimit(1 << 25)
    T = int(sys.stdin.readline())
    factorial = [1] * MAX
    inv_factorial = [1] * MAX

    # Precompute factorials and inverse factorials
    for i in range(1, MAX):
        factorial[i] = factorial[i - 1] * i % MOD

    inv_factorial[MAX - 1] = pow(factorial[MAX - 1], MOD - 2, MOD)
    for i in range(MAX - 2, -1, -1):
        inv_factorial[i] = inv_factorial[i + 1] * (i + 1) % MOD

    def comb(n, k):
        if k < 0 or k > n:
            return 0
        return factorial[n] * inv_factorial[k] % MOD * inv_factorial[n - k] % MOD

    for _ in range(T):
        n_str, m_str = sys.stdin.readline().split()
        n = int(n_str)
        m = int(m_str)
        total_paths = comb(n + m - 2, n - 1)
        total_cost = total_paths * (n * m - 1) % MOD
        print(total_cost)

# threading.Thread(target=main).start()
main()