//by 72
#include<bits/stdc++.h>
#define F(i, a, b) for(int i = a; i <= b; i ++)
#define Fd(i, a, b) for(int i = a; i >= b; i --)
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define int long long
using namespace std;

const int mod = 998244353;
const int N = 2e5 + 10;
const int inf = 1e18;
typedef array<int, 3> a3; 
typedef long long ll;

int n, m;
int cal(int x) {
    if(x % 4 == 3) return 0;
    else if(x % 4 == 0) return x;
    else if(x % 4 == 1) return 1;
    else return x + 1;
} 

void sol() {
    int l, r; cin >> l >> r;
    int s; cin >> s;
    int res = -1;
    F(i, l, l + 5) F(j, r - 5, r) {
        if(i > r || j < l || i > j) continue;
        if((cal(l - 1) ^ cal(r)) <= s) res = max(res, j - i + 1); 
    }
    cout << res << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    cin >> t;
    F(i, 1, t) sol();
    return 0;
}
//sldl