#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<map>
#include<stack>
#include<queue>
#include<ctime>
#include<vector>
#include<set>
using namespace std;
const int mod=1e9+7;
int jc[200000+5];
int jcn[200000+5];
int ksm(int a,int k)
{
    int s=1;
    while (k)
    {
        if (k&1) s=1ll*s*a%mod;
        k>>=1;a=1ll*a*a%mod;
    }
    return s;
}
int C(int x,int y)
{
    if (x<y||y<0) return 0;
    return 1ll*jc[x]*jcn[y]%mod*jcn[x-y]%mod;
}
int main()
{
    
    int T,n=200000;
    scanf("%d",&T);
    jc[0]=1;
    for (int i=1;i<=n;i++)
        jc[i]=1ll*jc[i-1]*i%mod;
    jcn[n]=ksm(jc[n],mod-2);
    for (int i=n-1;i>=0;i--)
        jcn[i]=1ll*jcn[i+1]*(i+1)%mod;
    while (T--)
    {
        int m;
        scanf("%d%d",&n,&m);
        printf("%lld\n",(1ll*n*m-1)%mod*C(n+m-2,n-1)%mod);
    }
}