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

const int P = 1e9 + 7;

template <class T> T qp(T a, int b) {
	T c = 1;
	for (; b; b /= 2, a *= a) {
		if (b % 2) c *= a;
	}
	return c;
}

struct mint {
	int x;
	mint(int _x = 0) : x(_x % P) { x < 0 ? x += P : 0; }
	int val() const { return x; }

	mint operator - () const {
		return !x ? 0 : P - x;
	}
	mint inv() const {
		assert(x != 0);
		return qp(*this, P - 2);
	}
	mint &operator += (const mint &rhs) {
		x += rhs.x - P, x += x >> 31 & P;
		return *this;
	}
	mint &operator -= (const mint &rhs) {
		x -= rhs.x, x += x >> 31 & P;
		return *this;
	}
	mint &operator *= (const mint &rhs) {
		x = (long long)x * rhs.x % P;
		return *this;
	}
	mint &operator /= (const mint &rhs) {
		return *this *= rhs.inv();
	}
	friend mint operator + (const mint &lhs, const mint &rhs) {
		mint res = lhs;
		return res += rhs, res;
	}
	friend mint operator - (const mint &lhs, const mint &rhs) {
		mint res = lhs;
		return res -= rhs, res;
	}
	friend mint operator * (const mint &lhs, const mint &rhs) {
		mint res = lhs;
		return res *= rhs, res;
	}
	friend mint operator / (const mint &lhs, const mint &rhs) {
		mint res = lhs;
		return res /= rhs, res;
	}

	friend ostream &operator << (ostream &os, const mint &a) {
		return os << a.val();
	}
};

void solve() {
	int n, m;
	cin >> n >> m;
	auto binom = [&](int x, int y) {
		mint ans = 1;
		for (int i = 1; i <= y; i++) {
			ans *= x - i + 1;
			ans /= i;
		}
		return ans;
	};
	mint ans = binom(n + m - 2, n - 1);
	ans *= mint(n) * m - 1;
	cout << ans << "\n";
}

int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	int T;
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}