#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 5;
int inv[maxn];
int sum[maxn];
int get_ans(int n,int m) {
    int ans = (n * m - 1) % mod;
    ans = ans * (inv[m - 1] * (sum[n + m - 2] * inv[n - 1] % mod) % mod) % mod;
    return ans;
}
signed main() {
    int t;
    cin>>t;
    inv[0] = 1;
    inv[1] = 1;
    sum[1] = 1;
    sum[0] = 1;
    for(int i = 2;i <= 2e5;i++) {
        sum[i] = sum[i - 1] * i % mod;
    }
    for(int i = 2;i <= 2e5;i++) {
        inv[i] = (mod - mod / i) * inv[mod % i] % mod;
    }
    for(int i = 2;i <= 2e5;i++) {
        inv[i] = inv[i] * inv[i - 1] % mod;
    }
    int n,m;
    while(t--) {
        cin>>n>>m;
        cout<<get_ans(n,m)<<endl;
    }
    return 0;
}