#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;
typedef pair<int,int>pi;
int dpdp(int bit, vector<pi>&vec, bool done){
	if(vec.empty())return oo;
	if(bit==-1)return 0;
	if(vec.size() == 1){
		if(done || vec[0].second == 2){
			return (1<<(bit+1))-1;
		} else{
			return vec[0].first + (1<<(bit+1))-1;
		}
	}
	vector<pi>lf,rg;
	for(auto x:vec){
		if(x.first&(1<<bit))rg.push_back(x);
		else lf.push_back(x);
	}

	if(lf.empty()){
		return (1<<bit) + dpdp(bit-1,rg,done);
	} 
	if(rg.empty()){
		return (1<<bit) + dpdp(bit-1,lf,done);
	}
	if(done==0 && rg.size() == 1 && rg[0].second == 1){
		return (1<<bit) + dpdp(bit-1,lf,1);
	}

	return max(dpdp(bit-1,lf,done),dpdp(bit-1,rg,done));

}
void solve(){
	cin>>n>>m>>k; 
	--k;
	for(int i=1;i<=n;i++)cin>>A[i];
	for(int i=1;i<=n;i++)cin>>B[i];
	vector<pi>as;
	for(int i=1;i<=n;i++)as.push_back({A[i],B[i]});
	cout<<dpdp(k,as,0)<<"\n";
}
int32_t main(){
	int c,t;cin>>c>>t;
	while(t--)solve();
}