#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

ll get(ll x, ll y, ll k, ll b) {
    ll tail = (1ll << b) - 1;
    ll xt = x & tail;
    ll yt = y & tail;

    ll xs = (x >> b);
    ll ys = (y >> b);

    ll res = 0;

    if (x == y) return 0;
    if ((xs == ys) || (x + 1 == y) || ((x ^ y) < k)) return 1;
    
    if (xs + 1 == ys) {
        if ((xs % 2 == 0) && (k != (1ll << b))) {
            res = 2;
        } else {
            res = 3;
            if (xt == tail) res--;
            if (yt == 0) res--;
        }
        return res;
    }

    if (k == (1ll << b)) {
        return 2 * (ys - xs - 1) + get((ys - 1) << b, y, k, b);
    }
    if (xs % 2 == 1) {
        return 2 + get((xs + 1) << b, y, k, b);
    } else {
        ll h = (ys - xs) / 2;
        return 3 * h + get(((xs + 2 * h) << b), y, k, b);
    }

    // if (xs % 2)
}

void solve() {
    ll x, y, k;
    cin >> x >> y >> k;
    if (x > y) swap(x, y);

    if (x == y) {
        cout << "0\n";
        return;
    }

    if (((x ^ y) <= k) || (y - x <= 1)) {
        cout << "1\n";
        return;
    }

    ++k;

    int b = 0;
    for (int i = 0; i < 60; ++i) {
        if ((k >> i) & 1) b = i;
    }

    ll res = min(get(x, y, k, b), get(x + 1, y, k, b) + 1);
    
    ll tail = (1ll << b) - 1;
    ll xt = x & tail;
    // ll yt = y & tail;

    if ((xt ^ ((1ll << (b + 1)) - 1)) < k) res = min(res, 2 + get((x ^ (xt ^ ((1ll << (b + 1)) - 1))) + 1, y, k, b));

    cout << res << '\n';
    return;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t;
    cin >> t;
    while(t--) solve();


    return 0;
}