#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
 
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
 
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
 
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
 
#define int long long
using namespace std;
 
const int INF = 1e9 + 7;
const int MAXN = 505;
const int MAXM = 2.5e4 + 5;

int x, y, k;

int dist(int a, int b) {
    if(a == b) return 0;
    if((a ^ b) <= k || (abs(a - b) == 1)) return 1;
    return 2;
}

void solve() {
    cin >> x >> y >> k;
    if(x > y) swap(x, y);
    
    if(k <= 1) { 
        cout << abs(x - y) << endl; return;
    }
    
    int t = 0;
    while((1 << t) <= k) ++t;
    
    int blocksz = (1 << t);
    int numblocks = y / blocksz - x / blocksz;
    // cout << "numblocks: " << numblocks << endl;
    if(x / blocksz == y / blocksz) cout << dist(x % blocksz, y % blocksz) << endl;
    else cout << dist(0, y % blocksz) + dist(x % blocksz, blocksz - 1) + (numblocks - 1) * dist(0, blocksz - 1) + numblocks << endl;
    // cout << dist(0, y % blocksz) << " " << dist(x % blocksz, blocksz - 1) << "(" << x % blocksz << " " << blocksz - 1 << ") " << (numblocks - 1) * dist(0, blocksz - 1) << " " << numblocks << endl;
    // dist to reduce y down + dist to bring x up + dist for each block * number of blocks + 1 per block to actually transition between blocks
}

signed main() {
    int t; cin >> t;
    while(t--) solve();
}