#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAXN 100010
#define MOD 1000000007
using namespace std;

inline long long read() {
    register long long x = 0, f = 1;
    char ch = getchar();
    while (!isdigit(ch)) {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (isdigit(ch)) {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x * f;
}

long long t, n, m;
long long inv[MAXN << 1], invn[MAXN << 1];

inline long long Orz_Zhengzhiyuan(long long a, long long b) {
    long long base = 1;
    for (; b; b >>= 1) {
        if (b & 1) base = base * a % MOD;
        a = a * a % MOD;
    }
    return base;
}

inline void Orz_Chengchunhao() {
    inv[0] = 1; invn[0] = 1;
    for (long long i = 1; i < (MAXN << 1); i++) {
        inv[i] = inv[i - 1] * i % MOD;
        invn[i] = Orz_Zhengzhiyuan(inv[i], MOD - 2);
    }
}

inline long long Orz_Xuqin(long long x, long long y) {
    if (x < y) return 0; ///避免使用Lucas定理的时候取Mod出错
    return (inv[x] * (invn[y] * invn[x - y] % MOD)) % MOD;
}

int main() {
    Orz_Chengchunhao();
    t = read();
    for (long long u = 1; u <= t; u++) {
        n = read(); m = read();
        printf("%lld\n", (((n * m - 1) % MOD) * Orz_Xuqin(n + m - 2, n - 1)) % MOD);
    }
    return 0;
}