#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
const int mod=1e9+7;
#define ll long long
#define pc(x) __builtin_popcountll(x)
inline int read(){
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+c-'0';c=getchar();}
	return x*f;
}
int n,m,T;
inline ll solve(ll l,ll r){
	ll len=r-l+1;
	if(len<=4){
		string S="";
		for(ll i=l;i<=r;i++)S+='0'+(pc(i)&1);
		if(len==1){
			if(S=="0")return 0;
			if(S=="1")return 1;
		}else if(len==2){
			if(S=="00")return 5;
			if(S=="01")return 0;
			if(S=="10")return 2;
			if(S=="11")return 1;
		}else if(len==3){
			if(S=="001")return 5;
			if(S=="010")return 3;
			if(S=="011")return 0;
			if(S=="100")return 4;
			if(S=="101")return 2;
			if(S=="110")return 1;
		}else{
			if(S=="0010")return 9;
			if(S=="0100")return 3;
			if(S=="0110")return 0;
			if(S=="1010")return 2;
			if(S=="1100")return 7;
			if(S=="0011")return 5;
			if(S=="0101")return 10;
			if(S=="1001")return 4;
			if(S=="1011")return 11;
			if(S=="1101")return 1;
		}
	}
	return 2*solve(l/2,r/2)+(l&1);
}
int main(){
	T=read();while(T--){
		ll l,r,len;scanf("%lld%lld",&l,&r);
		printf("%lld\n",solve(l,r));
	}
	return 0;
}