#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=1e9+7;
const int N=1000005;
int n,m;
inline int read()
{
	char C=getchar();
	int ANS=0,F=1;
	while (C<'0'||C>'9')
	{
		if (C=='-') F=-1;
		C=getchar();
	}
	while (C>='0'&&C<='9')
	{
		ANS=ANS*10+(C-'0');
		C=getchar();
	}
	return ANS*F;
}
ll jc[N],inv[N];
ll ksm(ll x,ll y)
{
	ll res=1;
	while (y)
	{
		if (y&1) res=res*x%mod;
		x=x*x%mod,y>>=1;
	}
	return res;
}
ll C(ll x,ll y)
{
	if (x<y||y<0) return 0;
	return jc[x]*inv[y]%mod*inv[x-y]%mod;
}
void init()
{
	jc[0]=1;
	for (int i=1;i<N;i++) jc[i]=jc[i-1]*i%mod;
	inv[N-1]=ksm(jc[N-1],mod-2);
	for (int i=N-2;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
}
void work()
{
	n=read(),m=read();
	ll tot=C(n+m-1-1,n-1),ans=tot*(m-1)%mod*n%mod;
	ans=(ans+tot*(n-1)%mod)%mod;
	cout << ans << endl;
}
int main()
{
	// freopen("count.in","r",stdin);
	// freopen("count.out","w",stdout);
	init();
	int T=read();
	while (T--) work();
	return 0;
}