B - Chessboard (组合数)

//1<=b<=a<=1e5 ,Cab mod (1e9+7)
#include <iostream>
#include <algorithm>
#define ll long long 
using namespace std;
const int N=1000010,mod=1e9+7;
int fact[N],infact[N];
int qmi(int a,int b,int m)
{
    int ans=1;
    while(b)
    {
        if(b&1) ans=(ll)ans*a%m;
        a=(ll)a*a%m;
        b>>=1;
    }
    return ans;
}
 
int main()
{
    fact[0]=infact[0]=1;
    for(int i=1;i<N;i++)
    {
        fact[i]=(ll)fact[i-1]*i%mod;
        infact[i]=(ll)infact[i-1]*qmi(i,mod-2,mod)%mod;
    }
    int T;scanf("%d",&T);
    while(T--){
	    int n,m;
	    scanf("%d%d",&n,&m);
	    if(n==1||m==1){
	    	printf("%d\n",2);
	    	continue;
		}
	    int a,b;
	    a=n+m-2;
	    b=n-1;
	    ll ans=1ll*fact[a]%mod*infact[b]%mod*infact[a-b]%mod;
	    ans=4*ans%mod;
	    printf("%lld\n",ans);
	}
    return 0;
}