#include<bits/stdc++.h>
#define ll long long
const int p=1e9+7;
using namespace std;

const int N=2e6+5;
ll jc[N],inv[N];
ll C(int x,int y) {
	return jc[x]*inv[y]%p*inv[x-y]%p;
}
int main(){
	jc[0]=1;
	for(int i=1;i<=2e6;++i) {
		jc[i]=1ll*jc[i-1]*i%p;
	}
	inv[1]=inv[0]=1;
	for(int i=2;i<=2e6;++i) {
		inv[i]=(p-p/i)*inv[p%i]%p;
	}
	for(int i=1;i<=2e6;++i) {
		inv[i]=inv[i-1]*inv[i]%p;
	}
	int T; scanf("%d",&T);
	while(T--) {
		int n,m; scanf("%d%d",&n,&m);
		if(n==1&&m==1) puts("1");
			else if(n==1||m==1) puts("2");
				else {
					printf("%lld\n",4*C(n+m-2,n-1)%p);
				}
	}
	return 0;
}