#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=100005;
int n,m,k;
int A[maxn],B[maxn];
const int oo = 1'000'000'000'000'000'000ll;
int dpdp(int bit, vector<int>&vec){
	if(bit==-1)return 0;
	if(vec.empty())return oo;
	vector<int>lf,rg;
	for(auto x:vec){
		if(x&(1<<bit))rg.push_back(x);
		else lf.push_back(x);
	}
	int res1=dpdp(bit-1,lf);
	int res2=dpdp(bit-1,rg);
	if(res1 == oo){
		return res2+(1<<bit);
	} 
	if(res2==oo){
		return res1+(1<<bit);
	}
	return max(res1,res2);
}
void solve(){
	cin>>n>>m>>k; 
	for(int i=1;i<=n;i++)cin>>A[i];
	for(int i=1;i<=n;i++)cin>>B[i];
	vector<int>as;
	for(int i=1;i<=n;i++)as.push_back(A[i]);
	cout<<dpdp(k,as)<<"\n";
}
int32_t main(){
	int c,t;cin>>c>>t;
	while(t--)solve();
}