#include<bits/stdc++.h>
using namespace std;
#define pi pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ls (rt<<1)
#define rs (rt<<1|1)
#define mid ((l+r)>>1)
#define lowbit(x) (x&-x)
#define int long long
const int maxn=2e5+5,M=2e5+5,mod=1e9+7;
inline int read(){
	char ch=getchar();bool f=0;int x=0;
	for(;!isdigit(ch);ch=getchar())if(ch=='-')f=1;
	for(;isdigit(ch);ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
	if(f==1){x=-x;}return x;
}
void print(int x){
    static int a[55];int top=0;
    if(x<0) putchar('-'),x=-x;
    do{a[top++]=x%10,x/=10;}while(x);
    while(top) putchar(a[--top]+48);
}
int n,m,fac[maxn],inv[maxn],T,ans=0;
int C(int x,int y){return fac[x]*inv[y]%mod*inv[x-y]%mod;}
void init(int n){
	inv[0]=inv[1]=fac[0]=1;
	for(int i=2;i<=n;i++)inv[i]=inv[mod%i]*(mod-mod/i)%mod;
	for(int i=1;i<=n;i++)fac[i]=fac[i-1]*i%mod,inv[i]=inv[i-1]*inv[i]%mod;
}
void solve(){
	n=read(),m=read();
	ans=C(n+m-2,m-1)*(n%mod*m%mod-1)%mod;
	cout<<ans<<endl;
}
signed main(){
	//freopen("1.in","r",stdin);
	//freopen(".out","w",stdout);
	T=read();init(200000);
	while(T--)solve();
 	return 0;
}