#include<bits/stdc++.h>
using namespace std;
const int N=2e5;
const int maxn=2e5+10;
const int mod=1e9+7;
const int iv2=(mod+1)/2;
inline int read(){
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+c-'0';c=getchar();}
	return x*f;
}
int T,n,m,fac[maxn],ifc[maxn],inv[maxn];
inline void solve(){
	n=read(),m=read();
	printf("%d\n",1ll*(1ll*(n+m)*(n+m+1)/2-1ll*n*(n+1)/2-1ll*m*(m+1)/2-1)%mod*fac[n+m-2]%mod*ifc[n-1]%mod*ifc[m-1]%mod);
}
int main(){
	inv[1]=fac[0]=ifc[0]=1;
	for(int i=2;i<=N;i++)inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
	for(int i=1;i<=N;i++)fac[i]=1ll*fac[i-1]*i%mod;
	for(int i=1;i<=N;i++)ifc[i]=1ll*ifc[i-1]*inv[i]%mod;
	T=read();while(T--)solve();
	return 0;
}