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

using pii = pair<int, int>;
const int N = 1e6 + 10;

int pf[N], w[N];
vector<int> primes;

vector<int> factors[N];
vector<int> nxt[N];

int cost[N];
bool vis[N];

struct smallpq{
    vector<int> item[16];
    int cnt = 0, ptr = 16; 
    void push(const pii &a) {
        item[a.first].push_back(a.second);
        ptr = min(ptr, a.first);
        cnt ++;
    }
    int size() {return cnt;}
    pii top() {
        return {ptr, item[ptr].back()};
    }
    void pop() {
        item[ptr].pop_back();
        cnt --;
        if(cnt > 0)
            while(item[ptr].empty()) ptr ++;
    }
} q;

int solve() {
    int L, R;
    cin >> L >> R;

    for(int i = L + 1; i <= R; i ++)
        vis[i] = false;


    for(int i = 1; i <= R; i ++) {
        nxt[i].clear();
        for(int j = i; j <= R; j += i)
            if(j > L) nxt[i].push_back(j);
        sort(nxt[i].begin(), nxt[i].end(), [](int a, int b) {return w[a] > w[b];});
        cost[i] = L % i == 0 ? w[L] - w[i] : w[L];
        if(nxt[i].size()) q.push({w[nxt[i].back()] + cost[i], i});
    }

    int ans = 0;

    while(q.size()) {
        auto [c, p] = q.top();
        q.pop();

        if(nxt[p].empty() || c != cost[p] + w[nxt[p].back()]) continue;

        int tar = -1;

        if(!vis[nxt[p].back()]) {
            vis[nxt[p].back()] = true;
            tar = nxt[p].back();
            ans += c;
        }

        while(nxt[p].size() && vis[nxt[p].back()])
            nxt[p].pop_back();
        
        if(nxt[p].size()) q.push({w[nxt[p].back()] + cost[p], p});
        
        if(tar > 0)
            for(auto fc : factors[tar])
                if(cost[fc] > w[tar] - w[fc]) {
                    cost[fc] = w[tar] - w[fc];
                    if(nxt[fc].size()) q.push({w[nxt[fc].back()] + cost[fc], fc});
                }
    }

    return ans;
}

int main() {
    for(int i = 2; i < N; i ++) {
        if(!pf[i]) {
            pf[i] = i;
            w[i] = 1;
            primes.push_back(i);
        }
        for(int j : primes) {
            if(i * (long long)j >= N) break;
            pf[i * j] = j;
            w[i * j] = w[i];
            if(i % j == 0) break;
            w[i * j] ++;
        }
    }

    for(int i = 1; i < N; i ++)
        for(int j = i; j < N; j += i)
            factors[j].push_back(i);

    ios::sync_with_stdio(false);
    cin.tie(0);

    int T;
    cin >> T;
    while(T --)
        cout << solve() << "\n";
}