// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define int long long
#define i128 __int128
#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline i128 read()
{
    char c=getchar();i128 x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}
void write(__int128 x){
	// print a __int128 variable
	if(x < 0){putchar('-'); x = -x;}
	if(x > 9)write(x / 10);
	putchar(x % 10 + '0');
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
 
#define maxn 100005
#define inf 0x3f3f3f3f

#define N maxn*129

int n,m,k;
i128 a[maxn];
ll b[maxn];

i128 pw[133],INF;

int ch[N][2],tot;
ll sum[N];
i128 mn[N];

int newn(){
	int u=++tot;
	sum[u]=0,mn[u]=INF;
	ch[u][0]=ch[u][1]=0;
	return u;
}
void ins(i128 a,ll b){
	int u=1;
	sum[u]+=b;
	mn[u]=min(mn[u],a);
	Rep(i,k-1,0){
		int c=(a>>i&1);
		if(!ch[u][c])ch[u][c]=newn();
		u=ch[u][c];
		sum[u]+=b;
		mn[u]=min(mn[u],a);
	}
}

i128 res;

void dfs(int u,int d,i128 now,i128 mns,i128 xs,int sumb){
	if(d==-1){
//		write(now);cout<<" now\n";
		res=max(res,now);
		return;
	}
//	cout<<"u: "<<u<<"\n";
	if(!u){
		i128 tmp=mns+xs+pw[d+1]-1;
	//	write(tmp);cout<<" tmp\n";
		res=max(res,(pw[d+1]-1)+mns+xs);
		return;
	}
	bool hav=0;
	if(min(mns,mn[ch[u][0]])+xs+pw[d]-1>=now+pw[d]
		&& sumb+sum[ch[u][0]]<=m) 
			dfs(ch[u][1],
			d-1,
			now|pw[d],
			min(mns,mn[ch[u][0]]),
			xs,
			sumb+sum[ch[u][0]]),hav=1;
	if(min(mns,mn[ch[u][1]])+xs+pw[d+1]-1>=now+pw[d]
		&& sumb+sum[ch[u][1]]<=m)
			dfs(ch[u][0],
			d-1,
			now|pw[d],
			min(mns,mn[ch[u][1]]),
			xs^pw[d],
			sumb+sum[ch[u][1]]),hav=1;
	if(hav) return;
	dfs(ch[u][0],d-1,now,mns,xs,sumb);
	dfs(ch[u][1],d-1,now,mns,xs^pw[d],sumb);
}

void work()
{
	tot=0,newn(); mn[0]=INF;
	n=read(),m=read(),k=read();
	For(i,1,n)a[i]=read();
	For(i,1,n)b[i]=read();
	ll sb=0;
	For(i,1,n)sb+=b[i];
	if(sb<=m){
		cerr<<"QAQ\n";
		i128 res=INF;
		For(i,1,n)res=min(res,a[i]);
		
		res+=pw[k]-1;
		write(res);
		puts("");
		return;
	}
	For(i,1,n)ins(a[i],b[i]);
//	cout<<"tot "<<tot<<"\n";
	res=0;
	dfs(1,k-1,0,INF,0,0);
	write(res);
	puts("");
}

signed main()
{
//	freopen("xor2.in","r",stdin);
	pw[0]=1;
	For(i,1,125)pw[i]=pw[i-1]*2;
	INF=pw[125];
	read();int T=read();
	while(T--)work();
	return 0;
}
/*
1 2
5 2 3
1 1 2 3 7
1 1 0 3 2
1 1 1
1
0
*/