#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, int adder){
	if(bit==-1)return min(0ll,adder);
	if(vec.empty())return adder;
	
	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()){
		if(adder>=oo)return (1<<bit)+dpdp(bit-1,rg,adder);
		else {
			return max((1<<bit)+dpdp(bit-1,rg,adder-(1<<bit)), dpdp(bit-1,rg,oo));
		}
	} 
	if(rg.empty()){
		return (1<<bit) + dpdp(bit-1,lf,adder);
	}
	return max(dpdp(bit-1,lf,adder+(1<<bit)), dpdp(bit-1,rg,adder+(1<<bit)));
}
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];
	if(n==1){
		if(B[1] == 1){
			cout<<A[1] + (1<<(k+1))-1<<"\n";	
		} 
		return;
	}
	vector<pi>as;
	int adder=oo;
	for(int i=1;i<=n;i++){
		if(B[i] == 2)as.push_back({A[i],B[i]});
		else adder=A[i];
	}
	cout<<dpdp(k,as,adder)<<"\n";
}
int32_t main(){
	int c,t;cin>>c>>t;
	while(t--)solve();
}