import sys 
input = sys.stdin.buffer.readline
def main():
    N = 5*pow(10,5) + 1000
    MOD = pow(10,9) + 7

    fac = [-1]*(N+1); fac[0] = 1; fac[1] = 1 #階乗
    finv = [-1]*(N+1); finv[0] = 1; finv[1] = 1 #階乗の逆元
    inv = [-1]*(N+1); inv[0] = 0; inv[1] = 1 #逆元
    for i in range(2,N+1):
        fac[i] = fac[i-1]*i%MOD
        inv[i] = MOD - inv[MOD%i]*(MOD//i)%MOD
        finv[i] = finv[i-1]*inv[i]%MOD

    def cmb(n, r, p):
        if (r < 0) or (n < r):
            return 0
        r = min(r, n - r)
        return fac[n]*finv[r]*finv[n-r]%p
    
    def perm(n,r,p):
        if (r < 0) or (n < r):
            return 0
        return fac[n]*finv[n-r]%p


    t = int(input())
    for _ in range(t):
        h, w = map(int,input().split())
        ans = 2*(h+w-3)*cmb(h+w-4,h-2,MOD)%MOD
        print(ans)

if __name__ == '__main__':
    main()