#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void brute(ll L, ll R, ll S) {
    static ll xsum[32];
    for (ll i = L; i <= R; i ++) xsum[i - L + 1] = xsum[i - L] ^ i;
    ll ans = -1;
    for (ll i = L; i <= R; i ++) {
        for (ll j = i; j <= R; j ++) {
            if ((xsum[j - L + 1] ^ xsum[i - L]) <= S) ans = max(ans, j - i + 1);
        }
    }
    cout << ans << '\n';
}

void solve() {
    ll L, R, S;
    cin >> L >> R >> S;
    if (R - L <= 30) {
        brute(L, R, S);
        return ;
    }
    ll l = L, r = R;
    while (l & 3) l ++;
    while (r + 1 & 3) r --;
    ll xsum = 0, ans = -1;
    for (ll i = l; i >= L; i --) {
        if (i < l) xsum ^= i;
        ll tmp = xsum;
        for (ll j = r; j <= R; j ++) {
            if (j > r) tmp ^= j;
            if (tmp <= S) ans = max(ans, j - i + 1);
        }
    }
    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
    int T;
    cin >> T;
    while (T --) solve();
    
    return 0;
}