codeforces div.2 922 C题，求hack

#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
const int maxn = 1e6 + 7 ;
inline ll read(){
	ll x = 0 , f = 1 ;
	char c = getchar() ;
	while(c > '9' || c < '0'){
		if(c == '-')
			f = -1 ;
		c = getchar() ;
	}
	while(c >= '0' &&c <= '9'){
		x = x * 10 + c - '0' ;
		c = getchar() ;
	}
	return x * f ;
}
ll t , n , m , k , a[maxn] , b[maxn] ;
char s[maxn] ;
void solve(){
	for(int i = 0 ; i <= 100 ; i ++){
		a[i] = 0 ;
		b[i] = 0 ;
	}
	n = read() ;
	m = read() ;
	k = read() ;
	ll Ans = llabs(n - m) ;
	for(ll i = 63 ; i >= 0 ; i --){
		ll res = (n >> i) & 1 ;
		if(res == 1){
			a[i] = 1 ;
		}
		else{
			a[i] = 0 ;
		}
	}
//	for(int i = 0 ; i <= 10 ; i ++){
//		cout << a[i] << " " ;
//	}
//	cout << endl ;
	for(ll i = 63 ; i >= 0 ; i --){
		ll res = (m >> i) & 1 ;
		if(res == 1){
			b[i] = 1 ;
		}
		else{
			b[i] = 0 ;
		}
	}
	ll sum = 0 ;
	for(ll i = 63 ; i >= 0 ; i --){
		if(sum >= k){
			break ;
		}
//		cout << a[i] << " " << b[i] << endl ;
		if((a[i] == 0 && b[i] == 0) || (a[i] == 1 && b[i] == 1)){
			continue ;
		}
		else{
			sum = sum + (1ll << i) ;
			if(sum > k){
				sum -= (1ll << i) ;
				continue ;
			}
			ll Anss = (n ^ sum) - (m ^ sum) ;
			if(llabs(Anss) < Ans){
				Ans = llabs(Anss) ;
			}
			else{
				sum = sum - (1ll << i) ;
			}
		}
	}
	cout << Ans << endl ;
}
int main(){
	t = read() ;
	while(t -- ){
		solve() ;
	}
	return 0 ;
}