#include <bits/stdc++.h>
#include <assert.h>
using namespace std;
typedef long long ll;
#define ep emplace_back
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define fin freopen("in.in","r",stdin);
inline int read() {
	int x=0, v=1,ch=getchar();
	while('0'>ch||ch>'9') {
		if(ch=='-') v=0;
		ch=getchar();
	}while('0'<=ch&&ch<='9') {
		x=(x*10)+(ch^'0');
		ch=getchar();
	}return v?x:-x;
}
const int MAX = 2e5+5, P = 1e9+7;
int T, fac[MAX], inv[MAX];
int n,m;

int qpow(int x,int p) {
	int ret=1;
	for(;p;x=1ll*x*x%P, p>>=1)if(p&1)ret=1ll*ret*x%P;
	return ret;
}
int C(int n,int m) {
	return (m < 0 || n < m) ? 0 : 1ll * fac[n] * inv[m] % P * inv[n-m] % P;
}
void init(int N = MAX - 5){
	fac[0] = 1;
	for(int i=1;i<=N;++i) fac[i] = 1ll * fac[i-1] * i % P;
	inv[N] = qpow(fac[N], P-2);
	for(int i=N;i>=1;--i) inv[i-1] = 1ll * inv[i] * i % P; 
}
void mian() {
	n=read(),m=read();
	printf("%lld\n", 1ll * ( 1ll * n * m % P + P - 1) % P * C(n+m-2,n-1) % P );
}
signed main() { 
	init();
	T=read();
	while(T--)mian();
	return 0;
}