// author : thembululquaUwU
// 3.9.2024

#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define endl '\n'

using namespace std;
using ll = long long;
using ii = pair <int, int>;
using vi = vector <int>;

const int MaxN = 2e5;
const int mod = 1e9 + 7;

void maxl(auto &a, auto b) {a = max(a, b);}
void minl(auto &a, auto b) {a = min(a, b);}

#define Mask(i)  (1ll << (i))
#define Bit(x, i)  ((x) >> (i) & 1)
#define bp __builtin_popcount
#define bpll __builtin_popcountll

void solve(){
    ll L, R, S; cin >> L >> R >> S;

    auto calc = [&](long long f) -> long long {
        long long ans = 0;
        for (int b = 0; b < 61; ++ b){
            long long x = Mask(b);
            if (!b){
                ll g = f / 2;
                if (g % 2 == 1) ans |= 1;
            }
            else {
                ll g = f / x;
                if (g % 2 == 1){
                    if ((f - g * x) % 2 == 1) ans |= x;
                }
            }
        }

        return ans;
    };

    ll xr = calc(R + 1) ^ calc(L);
    if (xr <= S) cout << R - L + 1 << endl;
    else {
        if (L == R) cout << -1 << endl;
        else cout << R - L << endl;
    }
}

int main(){
    if (fopen("pqh.inp", "r")){
        freopen("pqh.inp", "r", stdin);
        freopen("pqh.out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int t = 1; cin >> t;
    while (t --) solve();
    return 0;
}