import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


void bAdd(T)(T[] bit, int pos, T val)
in {
  assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold");
}
do {
  for (int x = pos; x < bit.length; x |= x + 1) {
    bit[x] += val;
  }
}

// sum of [0, pos)
T bSum(T)(T[] bit, int pos)
in {
  assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold");
}
do {
  T ret = 0;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    ret += bit[x];
  }
  return ret;
}


void main() {
  try {
    for (; ; ) {
      const Q = readInt;
      auto L = new int[Q];
      auto R = new int[Q];
      foreach (q; 0 .. Q) {
        L[q] = readInt;
        R[q] = readInt;
      }
      
      const maxR = R.maxElement;
      auto lpf = new int[maxR + 1];
      foreach (p; 2 .. maxR + 1) lpf[p] = p;
      foreach (p; 2 .. maxR + 1) if (lpf[p] == p) {
        for (int n = p; n <= maxR; n += p) chmin(lpf[n], p);
      }
      auto addss = new int[][maxR + 1];
      addss[0] ~= 1;
      foreach (n; 2 .. maxR + 1) {
        addss[n / lpf[n]] ~= n;
      }
      
      auto qss = new int[][maxR + 1];
      foreach (q; 0 .. Q) qss[L[q]] ~= q;
      auto ans = new int[Q];
      auto bit = new int[maxR + 1];
      foreach (l; 1 .. maxR + 1) {
        foreach (n; addss[l - 1]) bit.bAdd(n, +1);
        foreach (q; qss[l]) ans[q] = bit.bSum(R[q] + 1) - bit.bSum(L[q]);
      }
      
      foreach (q; 0 .. Q) {
        writeln(ans[q]);
      }
    }
  } catch (EOFException e) {
  }
}