#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001LL


int main(){
	vector<int> ma(1000005,0);
	for(int i=1;i<ma.size();i++){
		for(int j=i*2;j<ma.size();j+=i){
			ma[j] = i;
		}
	}
	int q;
	cin>>q;
	vector<int> l(q),r(q);
	vector<vector<int>> is(1000005);
	rep(i,q){
		cin>>l[i]>>r[i];
		is[r[i]].push_back(i);
		is[l[i]-1].push_back(i);
	}
	vector<int> ans(q);
	fenwick_tree<int> F(1000005);
	rep(i,is.size()){
		F.add(ma[i],1);
		rep(j,is[i].size()){
			int ii = is[i][j];
			int v = F.sum(0,l[ii]);
			if(r[ii]==i)ans[ii] += v;
			else ans[ii] -= v;
		}
		
	}
	rep(i,q){
		cout<<ans[i]<<endl;
	}
	return 0;
}