#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <typename T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <typename T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct IOST {
	IOST() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(20);
	}
} IOST;

void solve() {
	int q;
	cin >> q;
	vector<int> l(q), r(q);
	rep(i, 0, q) cin >> l[i] >> r[i];
	rep(i, 0, q) l[i]--;
	vector<int> p(q);
	iota(p.begin(), p.end(), 0);
	sort(p.begin(), p.end(), [&](int i, int j) {
		return l[i] > l[j];
	});
	int m = 1e6 + 10;
	atcoder::fenwick_tree<ll> bit(m + 1);
	int nl = m;
	vector<ll> ans(q);
	for (int i : p) {
		while (nl > l[i]) {
			bit.add(nl, 1);
			for (int j = nl * 2; j < m; j += nl) {
				bit.add(j, -bit.sum(j, j + 1));
			}
			nl--;
		}
		ans[i] = bit.sum(0, r[i] + 1);
	}
	rep(i, 0, q) cout << ans[i] << "\n";
}

int main() {
	int t = 1;
	// cin >> t;
	rep(i, 0, t) solve();
}