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; }
real readReal() { return readToken.to!real; }

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 main() {
  debug {{
    enum lim = 10;
    foreach (l; 0 .. lim) foreach (r; l .. lim) {
      auto fs = new int[l + r + 1];
      foreach (x; l .. r + 1) foreach (y; x .. r + 1) if (x + y <= l + r) {
        fs[x + y] ^= 1;
      }
      writeln(l, " ", r, ": ", fs);
    }
  }}
  
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const L = readLong;
        const R = readLong;
        
        const len = (L + R) - (2 * L) + 1;
        const q = len / 4, r = len % 4;
        long ans;
        ans ^= (q & 1);
        if (r == 0) {
          //
        } else if (r == 1) {
          ans ^= (2 * L) + 4 * q;
        } else {
          ans ^= 1;
        }
        
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}