#include <bits/stdc++.h>
#define int long long
#define mod 1000000007ll
using namespace std;
const long long MOD = 1000000007;
const int MAX = 1010000;

long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++) {
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
inline long long COM(int n, int k) { //二項係数
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

#define REP(i,n) for(int i=1;i<=n;i++)
int h,w,ans;
signed main() {
    int t;
    cin >> t;
    REP(_, t) {
        ans = 0;
        cin>>h>>w;
        h--;
        w--;
        COMinit();
        REP(i,h){
            if(w-1>=i)ans+=COM(h-1,i-1)*COM(w-1,i)%mod*i%mod*2%mod;
            ans%=mod;
            if(w-1>=i-1)ans+=COM(h-1,i-1)*COM(w-1,i-1)%mod*2%mod*(i*2-1)%mod;
            ans%=mod;
            if(w-1>=i-2)ans+=COM(h-1,i-1)*COM(w-1,i-2)%mod*(i*2-2)%mod;
            ans%=mod;
        }
        cout<<ans<<endl;
    }
}