#include<cstdio>
#include<algorithm>
#include<cstring>
typedef long long ll;
using namespace std;
const int MAXN=2e5+5,mod=1e9+7;
int n,m;
ll fac[MAXN],inv[MAXN];
ll Fstpw(ll a,int b){
	ll res=1;
	while(b){
		if(b&1) res=res*a%mod;
		b>>=1;
		a=a*a%mod;
	}
	return res;
}
int main(){
	//freopen("count.in","r",stdin);
	//freopen("count.out","w",stdout);
	n=2e5;
	fac[0]=1;
	for(int i=1; i<=n; i++)
		fac[i]=fac[i-1]*i%mod;
	inv[n]=Fstpw(fac[n],mod-2);
	for(int i=n; i; i--)
		inv[i-1]=inv[i]*i%mod;
	int _; scanf("%d",&_);
	while(_--){
		scanf("%d%d",&n,&m);
		printf("%lld\n",(1ll*n*m-1)%mod*fac[n+m-2]%mod*inv[n-1]%mod*inv[m-1]%mod);
	}
	//fclose(stdin);
	//fclose(stdout);
	return 0;
}