#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
using namespace std;

template<typename T>
inline void read(T &x)
{
    T k=1;char ch=getchar();x=0;
    while(ch<'0'||ch>'9'){if(ch=='-') k=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    x*=k;
}

typedef long long ll;
#define int ll
typedef pair<int,int> pii;
const int N=1e5+86;

void solve(int f)
{
    int x,y,k;
    read(x),read(y),read(k);
    if(f==809) printf("%lld %lld\n",x,y);
    if(y>x) swap(x,y);
    if(k<=1)
    {
        printf("%lld\n",x-y);
        return;
    }
    int bit=0;
    while((1<<bit)<=k) bit++;
    int p=(x>>bit)-(y>>bit),sum=0;//printf("%lld\n",p);
    if(!p) sum=0;
    else if((x&((1<<bit)-1))>k) sum=3;
    else if(x&((1<<bit)-1)) sum=2;
    else sum=1;
    if(!p) sum+=1+(((((1<<bit)-1)&y)^(((1<<bit)-1)&x))>k);
    else if((((1<<bit)-1)^(((1<<bit)-1)&y))>k) sum+=2;
    else if(((1<<bit)-1)^(((1<<bit)-1)&y)) sum+=1;
    else sum+=0;
    p-=(p>0);
    // printf("%lld\n",(((1<<bit)-1)^(((1<<bit)-1)&y)));
    printf("%lld\n",sum+p*(3-(k==((1<<bit)-1))));
}

signed main()
{
    int T;
    read(T);
    for(int i=1;i<=T;i++) solve(i);
    return 0;
}