#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;

ll my_gcd(ll a, ll b) {
    ll ret = 0;
    if (a < b) {
        swap(a, b);
    }
    if (b == 0) {
        ret = a;
    } else {
        ret = my_gcd(b, a % b);
    }
    return ret;
}

int main() {
    vector<ll> divisor(300002, -1);
    for (ll i = 2; i <= 300000; i++) {
        for (ll j = 2; j * i <= 300000; j++) {
            divisor[j * i] = j;
        }
    }
    vector<ll> phi(300002, 0);
    for (ll i = 2; i <= 300000; i++) {
        ll now = i;
        ll div = -1;
        ll tot = i;
        while (true) {
            if (divisor[now] == -1) {
                if (now != div) {
                    tot = tot * (now - 1);
                    tot /= now;
                }
                break;
            }
            if (div != divisor[now]) {
                div = divisor[now];
                tot = tot * (div - 1);
                tot /= div;
            }
            now /= div;
        }
        phi[i] = tot;
    }
    vector<ll> phi_sum(300002, 0);
    for (ll i = 2; i <= 300000; i++) {
        phi_sum[i] = phi_sum[i - 1] + phi[i];
    }
    ll T;
    cin >> T;
    while (T--) {
        ll L, R;
        cin >> L >> R;
        ll ans = 0;
        for (ll i = 2; i <= 500; i++) {
            ll k1 = (L - 1) / i;
            ll k2 = R / i;
            if (k1 < k2) {
                ans += phi[i];
            }
        }
        ll left = 0;
        ll right = 1;
        ll prev = R;
        while (true) {
            if (R < 500) {
                break;
            }
            ll nl = (L - 1) / (left + 1);
            ll nr = R / (right + 1);

            ll val = max(nl, nr);
            if (left != right) {
                ans += (phi_sum[prev] - phi_sum[max(val, 500LL)]);
            }
            if (val <= 500) {
                break;
            }
            prev = val;
            if (nl >= nr) {
                left++;
            } else {
                right++;
            }
        }
        cout << ans << endl;
    }
}