#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define LC k<<1
#define RC k<<1|1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repn(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = (n) - 1; i >= a; i--)
#define pern(i, a, n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
typedef pair<double, double> PDD;
typedef pair<ull, ull> PUU;
typedef pair<LL, LL> PLL;

const int N = 110000;
const int M = 1100000;
const int mod = 1e9+7;
const int inf = (int)1e9;
const LL INF = 1e18;
const double eps = 1e-9;

mt19937_64 Rand((unsigned long long)new char);
#define rand Rand

int T;
LL x, y, k;
int main() {
	IO;
	cin >> T;
	while (T--) {
		cin >> x >> y >> k;
		if (x > y) swap(x, y);
		if (k <= 1) {
			cout << y - x << "\n";
			continue;
		}
		LL ans = 0;
		int lk = 64 - __builtin_clzll(k);
		LL base = 1LL << lk;
		while (1) {
			if (x == y) break;
			int lx = 64 - __builtin_clzll(x), ly = 64 - __builtin_clzll(y);
			if ((x ^ y) <= k) {
				ans++;
				break;
			}
			LL d = x ^ y;
			int ld = 64 - __builtin_clzll(d);
			if (ld == lk) {
				ans += 2;
				break;
			}
			else if (((x + 1) ^ x) & base) {
				x++, ans++;
			}
			else {
				assert(ld > lk);
				LL flag = 0, coef;
				LL tgt = ((x >> lk) << lk) + (base - 1);
				if ((k & (k + 1)) == 0) coef = 2;
				else coef = 3;
				if ((x ^ tgt) <= k && coef == 3) flag = 1;
				x = (x >> lk) << lk;
				LL num = (y - x) / base;
				ans += num * coef - flag;
				x += num * base;
			}
		}
		cout << ans << "\n";
	}
	return 0;
}