#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  struct Q {
    int i, l, r;
  };
  int q;
  cin >> q;
  vector<Q> qs(q);
  rep(i, q) {
    qs[i].i = i;
    cin >> qs[i].l >> qs[i].r, qs[i].r++;
  }
  constexpr int M = 1000001;
  fenwick_tree<int> ft(M);
  rep(i, M) ft.add(i, 1);
  vector<char> d(M, 1);
  ranges::sort(qs, {}, [&](Q x) {
    return x.l;
  });
  VI ans(q);
  rrep(l, M) if (l) {
    for (int i = l + l; i < M; i += l) if (d[i]) {
      d[i] = 0;
      ft.add(i, -1);
    }
    while (qs.size() && qs.back().l == l) {
      auto [i, l, r] = qs.back(); qs.pop_back();
      ans[i] = ft.sum(l, r);
    }
  }
  for (auto x : ans) cout << x << '\n';
}