#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


int main() {
    int t;
    cin >> t;
    ll ans = 0;

    const int M = 2e5 + 10;
    vector<ll> w(M);
    iota(all(w), -1);
    w[0] = 0;
    repu(i, 1, M) {
        for(int j = i+i; j < M; j += i) w[j] -= w[i];
    }
    vector<ll> ccu(M+1);
    rep(i, M) ccu[i+1] = ccu[i] + w[i];

    while(t--) {
        ll a, b;
        cin >> a >> b;
        int l = a^ans, r = b^ans;
        ans = (l+r-2) * ll(r-l+1) / 2;
        auto calc = [&](int n) {
            vector<int> res;
            for(int i = 1; i < n;) {
                res.push_back(i);
                int x = (n-1) / i;
                int ni = (n-1) / x + 1;
                i = ni;
            }
            res.push_back(n);
            return res;
        };
        auto vr = calc(r+1);
        auto vl = calc(l); vl.push_back(r+1);
        int pl = 0, pr = 0;
        while(pl < vl.size()-1 && pr < vr.size()-1) {
            int xl = (l-1) / vl[pl], xr = r / vr[pr];
            if(xl < xr) {
                int ql = max(vl[pl], vr[pr]), qr = min(vl[pl+1], vr[pr+1]);
                ans -= ll(xr - xl - 1) * (ccu[qr] - ccu[ql]);
            }
            if(vl[pl+1] <= vr[pr+1]) pl++;
            else pr++;
        }
        cout << ans << '\n';
    }
    return 0;
}