#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define i64 long long
#define int long long
#define endl '\n'
#define lb(x) ((x) & (-x))
using namespace std;
const i64 mod = 1e9+7;
const int maxn = 1e4+10;
int ck(int x)
{
    int len = 0;
    while(x)
    {
        len++;
        x >>= 1;
    }
    return len;
}
signed main()
{
    IOS;
    int t;
    cin >> t;
    while(t--)
    {
        i64 x,y,k;
        cin >> x >> y >> k;
        int ans = 0,len = ck(k);
        int mx = -1;
        for(int i = 0; i < 60; ++i)
        {
            if((x >> i & 1) != (y >> i & 1)) mx = i;
        }
        int res = (k == (1LL << len) - 1 ? 1 : 2);
        if(mx >= len)
        {
            int xx = (x >> len),yy = (y >> len);
            ans += abs(xx-yy) * (res + 1);
            int now = 0;
            for(int i = 0; i < len; ++i)
            {
                if((x >> i) & 1)
                {
                    now += (1LL << i);
                    if(x < y) x -= (1LL << i);
                }
                else if(x > y) x += (1LL << i);
            }
            if(x < y)
            {
                if(now == (1LL << len) - 1) ans -= res;
                else if((1LL << len) - 1 - now <= k && res == 2) ans--;
            }
            else if(x > y)
            {
                if(now == 0) ans -= res;
                else if(now <= k && res == 2) ans--;
            }
        }
        int now = 0;
        for(int i = 0; i < len; ++i) if((x >> i & 1) != (y >> i & 1)) now += (1LL << i);
        if(now) ans += (now > k ? 2 : 1);
        cout << ans << endl;
    }
    return 0;
}