#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>;

pair<vector<int>, vector<int>> primes_lpf(const int n) {
  vector<int> primes; primes.reserve(n / 10);
  vector<int> lpf(n + 1);
  for (int i = 2; i <= n; i += 2) lpf[i] = 2;
  for (int i = 3; i <= n; i += 6) lpf[i] = 3;
  if (2 <= n) primes.push_back(2);
  if (3 <= n) primes.push_back(3);
  // 5 * x <= n, x <= floor(n / 5)
  const int n5 = n / 5;
  int x = 5;
  char add_next = 2;
  for (; x <= n5; x += add_next, add_next ^= 2 ^ 4) {
    int px = lpf[x];
    if (px == 0) {
      lpf[x] = px = x;
      primes.push_back(x);
    }
    for (int i = 2;; ++i) {
      int q = primes[i];
      int y = q * x;
      if (y > n) break;
      lpf[y] = q;
      if (q == px) break;
    }
  }
  for (; x <= n; x += add_next, add_next ^= 2 ^ 4) {
    if (lpf[x] == 0) {
      lpf[x] = x;
      primes.push_back(x);
    }
  }
  return {move(primes), move(lpf)};
}

constexpr int PSIZE = 200010;
auto [primes, lpf] = primes_lpf(PSIZE);

ll d[PSIZE];
ll s[PSIZE + 1];

} int main() {
  for (int i = 2; i < PSIZE; i++) {
    int cnt = i;
    int v = i;
    while (v != 1) {
      int p = lpf[v];
      cnt = cnt / p * (p - 1);
      do v /= p; while (v % p == 0);
    }
    d[i] = cnt;
  }
  rep(i, PSIZE) s[i+1] = s[i] + d[i];
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll ans = 0;
  int tt;
  cin >> tt;
  while (tt--) {
    ll lenc, renc;
    cin >> lenc >> renc;
    int l = (lenc ^ ans) - 1, r = renc ^ ans;
    // (l, r]
    int nxt = r;
    ans = 0;
    for (int k = 1; k <= 450; k++) {
      int lk = l / k, rk = min(r / k, nxt);
      ans += s[rk + 1] - s[lk + 1];
      nxt = lk;
    }
    for (int i = nxt; i >= 2; i--) {
      if (l / i < r / i) ans += d[i];
    }
    cout << ans << '\n';
  }
}