#include <bits/stdc++.h>
#define double long double
using namespace std;

inline int rd() {
	int x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

#define N 2000007
#define mod 1000000007

inline int fpow(int x, int t) {
	int res = 1;
	for (; t; t >>= 1, x = 1ll * x * x % mod)
		if (t & 1) res = 1ll * res * x % mod;
	return res;
}

int fac[N], ifac[N];

inline void init() {
	fac[0] = ifac[0] = 1;
	for (int i = 1; i < N; ++i) fac[i] = 1ll * fac[i - 1] * i % mod;
	ifac[N - 1] = fpow(fac[N - 1], mod - 2);
	for (int i = N - 2; i; --i) ifac[i] = 1ll * ifac[i + 1] * (i + 1) % mod;
}

inline int C(int n, int m) {
	return 1ll * fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}

inline void work() {
	int n = rd(), m = rd();
	if (n > m) swap(n, m);
	if (n == 1) {
		puts(m == 1 ? "1" : "2"); return;
	}
	printf("%d\n", 4ll * C(n + m - 2, n - 1) % mod);
}

int main() {
	init();
	for (int t = rd(); t; --t) work();
	return 0;
}