/*
    author:  Maksim1744
    created: 30.03.2024 11:50:09
*/

#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;

#define mp   make_pair
#define pb   push_back
#define eb   emplace_back

#define sum(a)     ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a)    (*min_element((a).begin(), (a).end()))
#define maxe(a)    (*max_element((a).begin(), (a).end()))
#define mini(a)    ( min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a)    ( max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin())

template<typename T>             vector<T>& operator--            (vector<T> &v){for (auto& i : v) --i;            return  v;}
template<typename T>             vector<T>& operator++            (vector<T> &v){for (auto& i : v) ++i;            return  v;}
template<typename T>             istream& operator>>(istream& is,  vector<T> &v){for (auto& i : v) is >> i;        return is;}
template<typename T>             ostream& operator<<(ostream& os,  vector<T>  v){for (auto& i : v) os << i << ' '; return os;}
template<typename T, typename U> pair<T,U>& operator--           (pair<T, U> &p){--p.first; --p.second;            return  p;}
template<typename T, typename U> pair<T,U>& operator++           (pair<T, U> &p){++p.first; ++p.second;            return  p;}
template<typename T, typename U> istream& operator>>(istream& is, pair<T, U> &p){is >> p.first >> p.second;        return is;}
template<typename T, typename U> ostream& operator<<(ostream& os, pair<T, U>  p){os << p.first << ' ' << p.second; return os;}
template<typename T, typename U> pair<T,U> operator-(pair<T,U> a, pair<T,U> b){return mp(a.first-b.first, a.second-b.second);}
template<typename T, typename U> pair<T,U> operator+(pair<T,U> a, pair<T,U> b){return mp(a.first+b.first, a.second+b.second);}
template<typename T, typename U> void umin(T& a, U b){if (a > b) a = b;}
template<typename T, typename U> void umax(T& a, U b){if (a < b) a = b;}

#ifdef HOME
#define SHOW_COLORS
#include "/mnt/c/Libs/tools/print.cpp"
#else
#define show(...) void(0)
#define debugf(fun)   fun
#define debugv(var)   var
#define mclock    void(0)
#define shows     void(0)
#define debug  if (false)
#define OSTREAM(...)    ;
#define OSTREAM0(...)   ;
#endif

void test_case(int test) {
    ll x, y, t;
    cin >> x >> y >> t;
    if (t == 0) {
        cout << abs(x - y) << '\n';
        return;
    }
    if (abs(x - y) <= 1) {
        cout << abs(x - y) << '\n';
        return;
    }
    if ((x ^ y) <= t) {
        cout << 1 << '\n';
        return;
    }
    if (x < y) swap(x, y);
    int k = 0;
    while ((1ll << (k + 1)) - 1 <= t) {
        ++k;
    }
    if (t == (1ll << k) - 1) {
        ll p2 = 1ll << k;
        ll ans = 0;
        if (x % p2 != 0) {
            x = x / p2 * p2;
            ++ans;
        }
        --x;
        ++ans;
        ll dif = x / p2 - y / p2;
        ans += dif * 2;
        x -= dif * p2;
        if (x != y) {
            assert((x ^ y) <= t);
            ++ans;
        }
        cout << ans << '\n';
    } else {
        ll p2 = 1ll << (k + 1);
        ll ans = 0;
        if (x % p2 != 0) {
            ll x0 = x / p2 * p2;
            ans += ((x ^ x0) <= t ? 1 : 2);
            x = x0;
        }
        --x;
        ++ans;
        ll dif = x / p2 - y / p2;
        ans += dif * 3;
        x -= dif * p2;
        if (x != y) {
            assert((x ^ y) < p2);
            if ((x ^ y) <= t) {
                ans += 1;
            } else {
                ans += 2;
            }
        }
        cout << ans << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    int T;
    cin >> T;
    for (int test = 1; test <= T; ++test) {
        test_case(test);
    }

    return 0;
}