#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,n) for (int i=(a);i<=(n);i++)
#define per(i,a,n) for (int i=(n);i>=(a);i--)
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define fi first
#define se second
#define lowbit(i) ((i)&(-i))
#define all(x) x.begin(),x.end()
#define SZ(x) ((int)x.size())
using namespace std;
const int N = 200015, mod = 1e9 + 7;
int n, m, fac[N], ifac[N];

int qpow(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) res = (ll) res * a % mod;
		a = (ll) a * a % mod;
		b >>= 1;
	}
	return res;
}

int Binom(int a, int b) {
	if (a < b || b < 0) return 0;
	return (ll) fac[a] * ifac[a - b] % mod * ifac[b] % mod;
}

void solve() {
	scanf("%d%d", &n, &m);
	ll ans = (ll) ((ll) (1 + m) * m / 2) % mod * Binom(n + m - 2, n - 2) % mod + (ll) ((ll) (1 + n) * n / 2) % mod * Binom(n + m - 2, m - 2) % mod;	// }
	printf("%lld\n", ans % mod);
}

int main() {
	fac[0] = 1;
	rep(i, 1, N - 1) fac[i] = (ll) fac[i - 1] * i % mod;
	ifac[N - 1] = qpow(fac[N - 1], mod - 2);
	per(i, 0, N - 2) ifac[i] = (ll) ifac[i + 1] * (i + 1) % mod;
	int t;
	scanf("%d", &t);
	while (t--) solve();	
	return 0;
}