#include <bits/stdc++.h>
using namespace std;
int num_fac[5000005];
void e_sieve() {
  for (int i = 2; i * i <= 5000005; i++) {
    for (int j = i; j * i <= 5000005; j++) {
      if (!num_fac[i]) num_fac[i] = 1;
      if (!num_fac[j]) num_fac[j] = 1;
      if (!num_fac[i * j]) num_fac[i * j] = 1;
      num_fac[i * j] = max(num_fac[i * j], num_fac[i] + num_fac[j]);
    }
  }
}
int main() {
  memset(num_fac, 0, sizeof(num_fac));
  e_sieve();
  vector<long long> prefixes;
  long long sum = 0;
  for (int i = 0; i < 5000005; i++) {
    if (!num_fac[i]) num_fac[i] = 1;
    sum += num_fac[i];
    prefixes.push_back(sum);
  }
  num_fac[0] = 0, num_fac[1] = 0;
  int t;
  cin >> t;
  while (t--) {
    int a, b;
    scanf("%d%d", &a, &b);
    printf("%ld\n", prefixes[a] - prefixes[b]);
  }
  return 0;
}
