#include<bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define ll long long
using namespace std;
void solve() {
    int x, y, k;
    cin >> x >> y >> k;
    if (x > y)
        swap(x, y);
    if (k == 0) {
        cout << abs(x - y) << "\n";
        return;
    }
    int bit = __lg(k) + 1;
    int tem = (y >> bit) - (x >> bit);
    if (tem == 0) {
        int xx = x & ((1 << bit) - 1), yy = y & ((1 << bit) - 1);
        if ((xx ^ yy) <= k) {
            cout << 1 << "\n";
        } else
            cout << 2 << "\n";
        return;
    }
    int cntjin = 3;
    if (__builtin_popcountll(k) == bit)
        cntjin--;
    int ans = 0;
    {
        int xx = x & ((1 << bit) - 1), yy = y & ((1 << bit) - 1);
        if (__builtin_popcountll(xx) == bit) {
            tem--;
            ans = 1;
        }
        else if ((xx ^ ((1 << bit) - 1)) <= k) {
            tem--;
            ans = 2;
        }
        if (!yy)
            ;
        else if (yy <= k)
            ans++;
        else
            ans += 2;
    }
    ans += cntjin * tem;
    cout << ans << "\n";
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t;
    cin >> t;
    while (t--)
        solve();
    return 0;
}