#include <bits/stdc++.h>
#define For(i, l, r) for (int i(l), e##i(r); i <= e##i; ++i)
#define Rof(i, r, l) for (int i(r), e##i(l); i >= e##i; --i)
using namespace std;
template<class T>void rd(T &x, char c = getchar(), bool f = true)
{
	for (; !isdigit(c); c = getchar()) f = c != '-';
	for (x = 0; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	x = f ? x : -x;
}
template<class A, class... B>void rd(A &x, B&... y) {rd(x), rd(y...);}
using i64 = long long;
using vi = vector<int> ;
template<const int T>using AR = array<int, T>;
#define pb push_back
#define SZ(x) (int)x.size()
const int N(2e5 + 5), P(1e9 + 7);
int T, n, m, fac[N + 5]{1}, ifac[N + 5];
int C(int a, int b)
{
	return a < b || b < 0 ? 0 : 1ll * fac[a] * ifac[b] % P * ifac[a - b] % P; 
}
int fpw(int a, int b)
{
	int t(1);
	for (; b; b >>= 1, a = 1ll * a * a % P) if (b & 1) t = 1ll * t * a % P;
	return t;
}
int main() 
{
	For(i, 1, N) fac[i] = 1ll * fac[i - 1] * i % P;
	ifac[N] = fpw(fac[N], P - 2);
	Rof(i, N, 1) ifac[i - 1] = 1ll * ifac[i] * i % P;
	for (rd(T); T--; )
	{
		int n, m;
		rd(n, m);
		printf("%lld\n", (1ll * n * m - 1) % P
			* C(n + m - 2, n - 1) % P);
	}
	return 0;
}