#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int p=1000000007,N=200000;
int T,n,m,fac[N+5],inv[N+5];
inline int qpow(int a,int b){
	int res=1;
	while(b){
		if(b&1)res=(ll)res*a%p;
		b>>=1,a=(ll)a*a%p;
	}
	return res;
}
inline int C(int n,int m){
	if(n<m || m<0)return 0;
	return (ll)fac[n]*inv[m]%p*inv[n-m]%p;
}
inline int solve(int n,int m){
	return n*(n+1ll)/2%p*C(n+m,m-1)%p;
}
int main(){
	scanf("%d",&T),fac[0]=1;
	for(int i=1;i<=N;++i)
		fac[i]=(ll)fac[i-1]*i%p;
	inv[N]=qpow(fac[N],p-2);
	for(int i=N;i>=1;--i)
		inv[i-1]=(ll)inv[i]*i%p;
	while(T--){
		scanf("%d%d",&n,&m),--n,--m;
		printf("%lld\n",((ll)C(n+m,m)*(n+m)+solve(n,m)+solve(m,n))%p);
	}
	return 0;
}