#include<bits/stdc++.h>
using namespace std;bool Mbe;
typedef __int128 LL;
const int IN=3e7,OUT=2e7;
char _i[IN],*_I=_i,_o[OUT],*_O=_o,__[40];
inline LL rd(){
	for(;*_I<0x30;_I++);LL x=0;
	for(;*_I>0x2f;_I++)x=(x<<1)+(x<<3)+(*_I^0x30);
	return x;
}
inline void wr(LL x){
	int l=0;
	do __[l++]=0x30|x%10;while(x/=10);
	while(l--)*_O++=__[l];*_O++=0xa;
}
namespace MAOJUN{

typedef long long ll;
const int N=1e5+5,K=120;
int n,m,k,b[N];LL a[N];

const int S=N*(K+1);
int idx,tr[S][2];ll sm[S];LL mn,as;
void dfs(int p,int d,int m,LL x,LL y){
	if(!~d){as=max(as,y);return;}
	LL k1=(LL)1<<d,k2=k1-1;
	if(!p){as=max(as,(x|k1|k2)+mn);return;}
	int ls=tr[p][0],rs=tr[p][1];bool f=0;
	if(sm[ls]<=m&&(x|k2)+mn>=(y|k1)){dfs(rs,d-1,m-sm[ls],x,y|k1);f=1;}
	if(sm[rs]<=m&&(x|k2)+mn>=y){dfs(ls,d-1,m-sm[rs],x|k1,y|k1);f=1;}
	if(!f){dfs(ls,d-1,m,x,y);dfs(rs,d-1,m,x|k1,y);}
}
inline void slv(){
	n=rd();m=rd();k=rd();
	for(int i=1;i<=n;i++)a[i]=rd();
	for(int i=1;i<=n;i++)b[i]=rd();
	mn=*min_element(a+1,a+n+1);
	if(accumulate(b+1,b+n+1,0ll)<=m){wr(((LL)1<<k)-1+mn);return;}
	for(int i=1;i<=idx;i++)tr[i][0]=tr[i][1]=sm[i]=0;
	idx=1;
	for(int i=1;i<=n;i++)
		for(int p=1,j=k-1;~j;j--){
			int c=a[i]>>j&1;
			if(!tr[p][c])tr[p][c]=++idx;p=tr[p][c];
			sm[p]+=b[i];
		}
	as=0;dfs(1,k-1,m,0,0);wr(as);
}
inline void main(){rd();for(int T=rd();T--;slv());}

}bool Med;int main(){
#ifdef LOCAL
	freopen("problem_8322/xor7.in","r",stdin);
	freopen("data.out","w",stdout);
	atexit([](){fprintf(stderr,"%dms\n%lfMB\n",clock(),(&Mbe-&Med)/1024./1024);});
#endif
	fread(_i,1,IN,stdin);
	MAOJUN::main();
	fwrite(_o,1,_O-_o,stdout);
	return 0;
}