#include<bits/stdc++.h>
using namespace std;
constexpr int N=100000,mod=1e9+7;
long long qpow(long long a,long long b){
	long long m=1;
	while(b){
		if(b&1) m=m*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return m;
}
int fac[(N<<1)+10],facinv[(N<<1)+10];
void initC(int n){
	int i;
	fac[0]=1;
	for(i=1;i<=n;++i) fac[i]=(long long)fac[i-1]*i%mod;
	facinv[n]=qpow(fac[n],mod-2);
	for(i=n;i>=1;--i) facinv[i-1]=(long long)facinv[i]*i%mod;
}
int C(int a,int b){return (long long)fac[a]*facinv[b]%mod*facinv[a-b]%mod;}
int main(){
	initC(N<<1);
	ios::sync_with_stdio(0);
	cin.tie(0);
	int T;
	cin>>T;
	while(T--){
		int n,m;
		cin>>n>>m;
		int tmp=((long long)n*m-1)%mod;
		cout<<(long long)tmp*C(n-1+m-1,n-1)%mod<<'\n';
	}
	return 0;
}