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)); }


// floor(a / b)
Int divFloor(Int)(Int a, Int b) {
  return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}

// ceil(a / b)
Int divCeil(Int)(Int a, Int b) {
  return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}


enum LIM = 2 * 10^^5 + 10;
int[] fs;
long[] fsSum;

long solve(long L, long R) {
  long ans;
  
  // L <= k p < (k+1) p <= R
  
  const sqrtR = cast(long)(sqrt(cast(real)(R)));
  // k <= sqrt(R)
  foreach (k; 1 .. sqrtR + 1) {
    long pL = divCeil(L, k);
    long pR = divFloor(R, k + 1);
    if (pL <= pR) {
      ans += (fsSum[pR] - fsSum[pL - 1]);
    }
  }
  // k > sqrt(R)
  foreach (p; 1 .. sqrtR + 1) {
    long kL = max(sqrtR + 1, divCeil(L, p));
    long kR = divFloor(R, p) - 1;
    if (kL <= kR) {
      ans += (kR - kL + 1) * fs[p];
    }
  }
  
  debug writefln("solve [%s, %s] = %s", L, R, ans);
  ans *= -1;
  ans += (R*(R-1)/2 - (L-1)*(L-2)/2);
  debug writefln("solve [%s, %s] = %s", L, R, ans);
  return ans;
}

void main() {
  fs = iota(LIM).array;
  foreach (d; 1 .. LIM) {
    for (int n = 2 * d; n < LIM; n += d) fs[n] -= fs[d];
  }
  // (1, 0)
  fs[1] -= 1;
  fsSum = new long[LIM];
  foreach (n; 1 .. LIM) fsSum[n] = fsSum[n - 1] + fs[n];
  
  try {
    for (; ; ) {
      const numCases = readInt;
      long ans;
      foreach (caseId; 0 .. numCases) {
        long L = readLong;
        long R = readLong;
        L ^= ans;
        R ^= ans;
        ans = solve(L, R);
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}