#include <bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i++)
#define per(i, r, l) for(int i = (r); i >= (l); i--)
#define mem(a, b) memset(a, b, sizeof a)
#define For(i, l, r) for(int i = (l), i##e = (r); i < i##e; i++)
#define pb push_back

using namespace std;
using u32 = uint32_t;
using u64 = uint64_t;
using ll = long long;

const int N = 1e5 + 8, M = 1e5, P = 1e9 + 7;

int n, m;
u32 fac[N << 1], ifac[N];

u64 Pow(u64 a, u64 n, u64 r = 1) {
    for(; n; n >>= 1, a = a * a % P)
        if(n & 1) r = r * a % P;
    return r;
}
inline u64 C(int n, int m) {
    return n >= 0 && m >= 0 ? (u64)fac[n + m] * ifac[n] % P * ifac[m] % P : 0;
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    fac[0] = 1;
    rep(i, 1, M << 1) fac[i] = (u64)fac[i - 1] * i % P;
    ifac[M] = Pow(fac[M], P - 2);
    per(i, M, 1) ifac[i - 1] = (u64)ifac[i] * i % P;
    int T, n, m;
    cin >> T;
    while(T--) {
        cin >> n >> m;
        cout << (m * (m + 1ULL) / 2 % P * (C(n - 1, m) - C(n - 1, m - 1) + P) + n * (n + 1ULL) / 2 % P * (C(n, m - 1) - C(n - 1, m - 1) + P)) % P << '\n';
    }
}