#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 2e3 + 10;


void solve()
{
    ll x, y, k;
    ll res = 0;
    cin >> x >> y >> k;
    if (x > y) swap(x, y);
    if (k == 0) {
        cout << y - x << '\n';
        return;
    }
    if (x == y) {
        cout << 0 << '\n';
        return;
    }
    if ((x ^ y) <= k) {
        cout << 1 << '\n';
        return;
    }
    ll len1 = ll(log2(x)) + 1, len2 = ll(log2(y)) + 1;
    ll kk = (1LL << (ll(log2(k)) + 1)) - 1;
    ll xx = x & kk, yy = y & kk;
    if(xx == kk) res = 1;
    else if (kk - xx <= k) res = 2;
    else res = 3;
    ll cnt2 = 0;
    if (k == kk) cnt2 = 2;
    else cnt2 = 3;
    // cout << res << " " << cnt2 << '\n';
    ll len = ll(log2(k)) + 1;
    ll fy = (y >> len);
    ll fx = (x >> len) + 1;
    res += cnt2 * (fy - fx);
    // cout << res << endl;
    if(yy == 0){
        cout << res << "\n";
        return ;
    }
    else if (yy <= k) {
        res++;
        cout << res << '\n';
        return;
    }
    cout << res + 2 << '\n';

    // res = min(abs(x - y), res);
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    ll t;
    cin >> t;
    while(t--) solve();
    return 0;
}