#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}


//return divisors list 1~uuper
//O(upper\log(upper))
std::vector<std::vector<int>> divisors_table(int upper){
    std::vector<std::vector<int>> res(upper+1);
    for(int i=1;i<=upper;i++){
        for(int j=i;j<=upper;j+=i){
            res[j].push_back(i);
        }
    }
    return res;
}

#include <atcoder/segtree>

ll op(ll a, ll b){
    return a + b;
}
ll e(){
    return 0;
}
void solve();
// CYAN / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll lim = 200'200;
    auto D = divisors_table(lim);
    vector<ll> dp(lim);
    rep(i, 2, lim){
        dp[i] += i - 1;
        for (int j = i * 2; j < lim; j += i){
            dp[j] -= dp[i];
        }
    }
    atcoder::segtree<ll, op, e> seg(dp);
    vector<ll> sum(lim);
    rep(i, 0, lim - 1) sum[i + 1] = sum[i] + dp[i];
    const int X = 2000;
    vector<vector<ll>> save(lim);
    rep(L, 2, lim){
        ll s = 1 + (L / X);
        rep(j, 0, s){
            save[L].push_back(seg.prod(L, min(lim, (ll)L + j * X)));
        }
        for (auto x : D[L]) {
        	if (x + L >= lim) break;
            seg.set(x + L, seg.get(x + L) + dp[x]);
        }
        seg.set(L, 0);
    }
    ll ans = 0;
    ll T;
    cin >> T;
    for (auto &x : D) reverse(all(x));
    while (T--){
        ll L, R;
        cin >> L >> R;
        L ^= ans;
        R ^= ans;
        // cout << L << " " << R << endl;
        ans = 0;
        R++;
        if (2 * (L - 1) < R){
            ans = sum[R];
        }
        else{
            int tmp = (R - L) / X;
            ans = save[L][tmp];
            tmp = tmp * X + L;
            while (tmp < R){
                for (auto x : D[tmp]){
                    if (L <= tmp - x) break;
                    // cout << ans << " " << dp[x] << " " << x << " " <<tmp << endl;
                    ans += dp[x];
                }
                tmp++;
            }
        }
        cout << ans << endl;
    }
}