#include <bits/stdc++.h>

#define f first
#define s second
#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int N = 300500, inf = 1e9, mod = 1000000007;
const ll INF = 1e18;

int sum(int a, int b) {
    a += b;
    if (a >= mod)
        a -= mod;
    return a;
}

int sub(int a, int b) {
    a -= b;
    if (a < 0)
        a += mod;
    return a;
}

int mult(int a, int b) {
    return 1ll * a * b % mod;
}

int bp(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1)
            res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int inv(int x) {
    return bp(x, mod - 2);
}

ll dp[1000000][32];
ll dp2[1000000][32];

void solve() {
    ll n, m;
    cin >> n >> m;
    ll m2 = round(sqrt(m))+20;
    for (ll i=1;i<=m2;i++)
    {
        dp2[i][0] = 1;
        for (int j=1;j<32;j++)
        {
            dp2[i][j] = 0;
        }
        ll w = 2;
        ll y = i/w;
        for (;w*w<=i;w++)
        {
            y = i/w;
            for (int j=1;j<32;j++)
            {
                dp2[i][j] = (dp2[i][j]+dp2[y][j-1])%mod;
            }
        }
        y = i/w;
        for (;y>0;y--)
        {
            ll r = i/y+1;
            for (int j=1;j<32;j++)
            {
                dp2[i][j] = (dp2[i][j]+dp2[y][j-1]*(r-w))%mod;
            }
            w = r;
        }
    }
    for (ll i=m2;i>=1;i--)
    {
        dp[i][0] = 1;
        for (int j=1;j<32;j++)
        {
            dp[i][j] = 0;
        }
        ll x2 = m/i;
        ll w = 2;
        ll y = x2/w;
        for (;i*w*w<=m;w++)
        {
            ll i2 = i*w;
            y = x2/w;
            if (i2<=m2)
            {
                for (int j=1;j<32;j++)
                {
                    dp[i][j] = (dp[i][j]+dp[i2][j-1])%mod;
                }
            }
            else
            {
                for (int j=1;j<32;j++)
                {
                    dp[i][j] = (dp[i][j]+dp2[y][j-1])%mod;
                }
            }
        }
        y = x2/w;
        for (;y>0;y--)
        {
            ll r = x2/y+1;
            for (int j=1;j<32;j++)
            {
                dp[i][j] = (dp[i][j]+dp2[y][j-1]*(r-w))%mod;
            }
            w = r;
        }
    }
    ll A = 1;
    ll ans = mod-1;
    for (int d=0;d<=31;d++)
    {
        if (d>n) continue;
        A = A*bp(d+1,mod-2)%mod;
        A = A*(n+1-d)%mod;
        ans = (ans+dp[1][d]*A)%mod;
    }
    cout << ans << "\n";
}

int main() {
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
    cin >> t;
    for (int i = 1; i <= t; i++) {
//        cout << "Case #" << i << endl;
        solve();
    }
}