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

const int mx = 1000000;

int main() {
	vector<int> xp(mx+1);
	vector bc(mx+1, vector<int>(0));
	vector bc_q(mx+1, vector<pair<int,int>>(0));

	for (int i=1; i<=mx; i++) {
		for (int j=2*i; j<=mx; j+=i) {
			xp[j] = i;
		}
	}

	for (int i=1; i<=mx; i++) {
		bc[xp[i]].push_back(i);
	}

	int q; cin >> q;
	for (int i=0; i<q; i++) {
		int l, r; cin >> l >> r;
		bc_q[l].push_back(pair(r, i));
	}

	vector<int> ans(q);
	atcoder::fenwick_tree<int> fw(mx+1);

	for (int i=0; i<=mx; i++) {
		for (auto [r,c]: bc_q[i]) {
			ans[c] = fw.sum(i, r+1);
		}
		for (int j: bc[i]) {
			fw.add(j, +1);
		}
	}

	for (int i=0; i<q; i++) {
		cout << ans[i] << '\n';
	}
}