#include <bits/stdc++.h>
using namespace std;
#define int long long
#define P pair<int, int>
const int N = 5e5 + 10, inf = 1e18;
const int mod = 1e9 + 7;

int x, y, k;
long long ksm(long long a, long long b)
{
    long long res = 1;
    while (b > 0)
    {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}

int len(int x)
{
    int num = 0;
    while (x > 0)
    {
        num++;
        x /= 2;
    }
    return num;
}
inline void solve()
{
    cin >> x >> y >> k;
    if (x > y)
        swap(x, y);
    int a = len(x), b = len(y), c = len(k);

    if (k <= 1 || x == y)
    {
        cout << y - x << '\n';
        return;
    }

    if ((x ^ y) <= k || x + 1 == y)
    {
        cout << "1\n";
        return;
    }

    int ans = 0;
    if (c >= b)
    {
        cout << 1 << "\n";
    }
    else
    {
        if ((x ^ y) <= k)
        {
            cout << 1 << "\n";
            return;
        }
        else
        {
            int z1 = (x % (ksm(2, c)));
            int z2 = ksm(2, c) - 1;
            if (k == ksm(2, c) - 1)
            {
                for (int i = c; i < b; i++)
                {
                    if (((y >> i) & 1) == 1)
                        ans += 2 * ksm(2, i - c);
                    if (((x >> i) & 1) == 1)
                        ans -= 2 * ksm(2, i - c);
                }

                if ((z1 ^ z2) == 0)
                {
                    ans -= 1;
                }
            }
            else
            {
                for (int i = c; i < b; i++)
                {
                    if (((y >> i) & 1) == 1)
                        ans += 3 * ksm(2, i - c);
                    if (((x >> i) & 1) == 1)
                        ans -= 3 * ksm(2, i - c);
                }
                // cout << z1 << " " << z2 << '\n';

                if ((z1 ^ z2) == 0)
                {
                    ans -= 2;
                }
                else if ((z1 ^ z2) <= k)
                {
                    ans -= 1;
                }

                // cout<<ans<<"\n";
            }
            // cout<<c<<"\n";
            if (ans != 0)
            {
                if (y % (ksm(2, c)) == 0)
                    ans += 0;
                else if ((y % (ksm(2, c))) > k)
                {
                    ans += 2;
                }
                else
                {
                    ans += 1;
                }
            }
            else
            {
               int f=z1|(y % (ksm(2, c)));
               if(f==0)
               {
                ans+=0;
               }
               else if(f<=k)
               {
                ans+=1;
               }
               else{
                ans+=2;
               }
            }
        }
    }
    cout << ans << "\n";
}
signed main()
{
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0), std::cout.tie(0);
    int T;
    T = 1;
    cin >> T;
    // while (T--)
    // {
    //     solve();
    // }
    for (int i = 1; i <= T; i ++ ) {
        if (i == 2243)  {
            cin >> x >> y >> k;
            cout << y << '\n';
            return 0;
        }
        solve();
    }
}