#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
#define popcnt __builtin_popcountll
const ll mod = 1e9+7;
inline ll read(){
	ll x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
inline ll lg2(ll x){ return 63^__builtin_clzll(x); }
inline ll qpow(ll a,ll b){
	ll ans=1, base=a;
	while(b){
		if(b&1) ans=ans*base%mod;
		base=base*base%mod; b>>=1;
	}
	return ans;
}
namespace math{
	const ll N = 2000000;
	ll fac[N+5],inv[N+5];
	ll qpow(ll a,ll b){
		ll ans=1,base=a;
		while(b){
			if(b&1) ans=ans*base%mod;
			base=base*base%mod; b>>=1;
		}
		return ans;
	}
	void init(){
		fac[0]=inv[0]=1;
		for(ll i=1;i<=N;i++) fac[i]=fac[i-1]*i%mod;
		inv[N]=qpow(fac[N],mod-2);
		for(ll i=N-1;i>=1;i--) inv[i]=inv[i+1]*(i+1)%mod;
	}
	inline ll binom(ll x,ll y){
		if(x<0 || y<0 || x<y) return 0;
		return fac[x]*inv[y]%mod*inv[x-y]%mod;
	}
	inline ll perm(ll x,ll y){
		if(x<0 || y<0 || x<y) return 0;
		return fac[x]*inv[x-y]%mod;
	}
}
void init(){ }

ll n,m;
void procedure(){
	n=read(), m=read();
	if(n==1 || m==1){
		puts(n==m?"1":"2");
		return;
	}
	printf("%llu\n", 4ull * math::binom(n+m-2, n-1) % mod);
}
int main(){
	#ifdef LOCAL
		assert(freopen("input.txt","r",stdin));
		assert(freopen("output.txt","w",stdout));
	#endif
	math::init();
	ll T=read();
	init();
	while(T--) procedure();
	return 0;
}