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

#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define len(a) (int)((a).size())

const ll INF = 1'000'000'000'000'000'000, MOD = 1'000'000'007;

ll root(ll a) {
    ll v = sqrt(a);
    while (v * v > a) --v;
    while ((v + 1) * (v + 1) <= a) ++v;
    return v;
}


ll sq_sum(ll n, ll add, ll dv) {
    ll calc = 0;
    for (ll v = 1; v <= n; ++v) {
        calc += (v * v + add) / dv;
        calc %= MOD;
    }
    return calc;
}

ll solve(ll a, ll n) {
    return ((n + 1) % MOD * (root(a * n)) % MOD - sq_sum(root(a * n), a - 1, a) + MOD) % MOD;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;
    while (t--) {
        ll a, n;
        cin >> a >> n;
        cout << solve(a, n) << endl;
    }

    return 0;
}