#include #include #include #include #include #include #include #include #include #include #define mkp make_pair #define mkt make_tuple #define rep(i, n) for (int i = 0; i < (n); ++i) #define all(v) v.begin(), v.end() using namespace std; typedef long long ll; const ll MOD = 1e9 + 7; // const ll MOD = 998244353; template void chmin(T &a, const T &b) { if (a > b) a = b; } template void chmax(T &a, const T &b) { if (a < b) a = b; } #define MAX_N 1000010 ll inv[MAX_N + 10], fac[MAX_N + 10], ifac[MAX_N + 10]; void setComb() { inv[0] = 1; inv[1] = 1; fac[1] = 1; ifac[1] = 1; fac[0] = 1; ifac[0] = 1; for (int i = 2; i < MAX_N; i++) { inv[i] = (-MOD / i) * inv[MOD % i] % MOD; fac[i] = fac[i - 1] * i % MOD; ifac[i] = ifac[i - 1] * inv[i] % MOD; inv[i] = (inv[i] + MOD) % MOD; fac[i] = (fac[i] + MOD) % MOD; ifac[i] = (ifac[i] + MOD) % MOD; } return; } ll comb(ll n, ll k) { if (n < k || n < 0 || k < 0) return 0; else return ((fac[n] * ifac[k] % MOD * ifac[n - k] % MOD + MOD) % MOD); } ll hcomb(ll n, ll r) { // this size is really ok?? if (n == 0 && r == 0) return 1; else if (n < 0 || r < 0) return 0; else return comb(n + r - 1, r); } ll binom(ll n, ll k) { if (n < k || n < 0 || k < 0) return 0; n %= MOD; ll res = 1; for (ll i = 0; i < k; i++) res = res * ((n - i + MOD) % MOD) % MOD; res = res * ifac[k] % MOD; return res; } ll mod_pow(ll x, ll n) { x %= MOD; ll res = 1; while (n > 0) { if (n & 1) res = res * x % MOD; x = x * x % MOD; n >>= 1; } return res; } ll mod_inverse(ll x) { return mod_pow(x, MOD - 2); } void add(ll &a, ll b) { a = (a + b) % MOD; } void mul(ll &a, ll b) { a %= MOD; b %= MOD; a = a * b % MOD; } void solve() { int H, W; cin >> H >> W; ll ans = 1; mul(ans, comb(H + W - 4, H - 2)); mul(ans, H + W - 3); mul(ans, 2); cout << ans << "\n"; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); setComb(); int T; cin >> T; rep(i, T) solve(); return 0; }