#include <bits/stdc++.h>
using namespace std;
#define int long long
#define P pair<int,int>
#define f(i,x,n,y) for(int i=x;i<=n;i+=y)
const int N = 1e6 + 10;
const int mod = 1000000007 , inf = 1e18;
int T, t, n, m, k, ans, sum, x, y;
int a[N], b[N], c[N];

inline void solve()
{ 
    cin>>x>>y>>k;
    if(x>y)swap(x,y);
    if(k<=1){
        cout<<y-x<<'\n';
        return;
    }
    int shux=x^y;
    if(shux<=k){
        cout<<"1\n";
        return;
    }
    int len=0;
    while((k>>len)>0)len++;
    ans=0;
    int num=0;
    for(int i=0;i<len;i++){
        if(((k>>i)&1)==1){
            ans++;
        }
        num+=1<<i;
    }
    int ci;
    if(len==ans)ci=2;
    else ci=3;
    int len2=0;
    while((y>>len2)>0)len2++;
    if(len2==len){
        int shu=y^x;
        if(shu<=k){
            cout<<"1\n";
        }else{
            cout<<"2\n";
        }
    }else{
        int shu=0;
        for(int i=0;i<len;i++){
            if(((x>>i)&1)==0){
                shu+=1<<i;
            }
            // cout<<((x>>i)&1)<<" ";
        }
        x+=shu+1;
        int tim=0;
        if(shu==0)tim++;
        else if(shu<=k)tim+=2;
        else tim+=3;
        tim+=(y-x)/(num+1)*ci;
        shu=0;
        for(int i=0;i<len;i++){
            if((y>>i)&1==1)shu+=1<<i;
        }
        if(shu==0)tim+=0;
        else if(shu<=k)tim+=1;
        else tim+=2;
        cout<<tim<<'\n';
    }
}

signed main()
{
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0), std::cout.tie(0);
    T = 1;
    cin >> T; 
    while (T--)
    {
        solve();
    }
}