/*
* @Author: ftt2333
* @Email: [email protected]
* @Last Modified time: 2022-11-05 09:23:02
*/

#include <bits/stdc++.h>
using namespace std;
#define qin cin
#define qout cout
#define off ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define fin(s) freopen(s, "r", stdin)
#define fout(s) freopen(s, "w", stdout)
#define fio(s) fin(s".in"), fout(s".out")
using ll = long long; using ull = uint64_t;
using lll = __int128; using ulll = __uint128_t;
using db = double; using ldb = long double;
using pii = pair<int, int>; using pll = pair<ll, ll>;
using vi = vector<int>; using vl = vector<ll>;
using uchar = unsigned char; using uint = unsigned int;
template<class T> using uid = uniform_int_distribution<T>;
template<class T> using urd = uniform_real_distribution<T>;
#define rep(i, a, b) for(auto i = (a); i <= (b); i++)
#define per(i, a, b) for(auto i = (a); i >= (b); i--)
#define go(i, h, e, x) for(int i = h[x]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define szof(a) ((int)(a).size())
#define mem(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))

mt19937 rnd(random_device{}());
const ll mod = 1e9 + 7;
const int N = 2e5 + 10;

ll gcd(ll a, ll b) { return a? gcd(b % a, a): b; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
void exgcd(ll a, ll b, ll &x, ll &y) {
  if(!b) { x = 1, y = 0; return; }
  exgcd(b, a % b, y, x); y -= a / b * x;
}
ll inv(ll a, ll p) { ll x, y; exgcd(a, p, x, y); return (x % p + p) % p; }
ll inv(ll x) { return inv(x, mod); }
ll qmul(ll x, ll y, ll p) { return ((lll)x * y) % p; }
ll qmul(ll x, ll y) { return qmul(x, y, mod); }
ll qpow(ll x, ll y, ll p) {
  ll r = 1;
  for(; y; y >>= 1, x = qmul(x, x, p))
    if(y & 1) r = qmul(r, x, p);
  return r;
}
ll qpow(ll x, ll y) { return qpow(x, y, mod); }

int fact[N], ifact[N];
int binom(int n, int m) {
  if(m > n || m < 0 || n < 0) return 0;
  return 1ll * fact[n] * ifact[m] % mod * ifact[n - m] % mod;
}
void init() {
  fact[0] = 1;
  rep(i, 1, N - 1) fact[i] = 1ll * fact[i - 1] * i % mod;
  ifact[N - 1] = inv(fact[N - 1]);
  per(i, N - 1, 1) ifact[i - 1] = 1ll * ifact[i] * i % mod;
}

void solve() {
  int n, m;
  qin >> n >> m;
  int e = binom(n + m - 2, n - 1);
  int e1 = 1ll * (m - 1) * (n + 1) % mod;
  int e2 = 1ll * (n - 1) * (m + 1) % mod;
  int ans = 1ll * e * (e1 + e2) % mod * inv(2) % mod;
  qout << ans << '\n';
}

int main() {
  init();
  int t; qin >> t;
  for(; t--; ) solve();
}