#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e6+5,M=(1<<15)+5,K=14348907+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int n,m,k,A[N],w[N];ll f[N];
pair<int,ll> B[100];int Bh;
void Solve(){
	int i,j,h;scanf("%d%d%d",&n,&m,&k);
	for(i=1;i<=n;i++) scanf("%d",&A[i]);
	for(i=1;i<=m;i++) scanf("%d",&w[i]);
	sort(A+1,A+n+1);fill(f,f+m+1,0);
	for(i=1;i<=(n+1)/2;i++){
		Bh=0;
		if(m==2){
			for(int j=0;j<=20;j++) B[++Bh]=make_pair(A[i]>>j,1ll*w[2]*j);
		}else{
			for(int x=0;x<3;x++){
				int p=A[i]>>x;
				for(int y=0;y<=13;y++) B[++Bh]=make_pair(p,1ll*x*w[2]+1ll*y*w[3]),p/=3;
			}
		}
		sort(B+1,B+Bh+1);
		f[B[1].fi]+=B[1].se;ll tot=B[1].se;
		for(j=2;j<=Bh;j++) if(tot>B[j].se) f[B[j].fi]-=tot,tot=B[j].se,f[B[j].fi]+=tot;
	}
	for(i=0;i<=m;i++){
		if(i) f[i]+=f[i-1];
		if(f[i]<=k){printf("%d\n",i);return;}
	}
	// for(i=1;i<=m;i++) printf("%lld ",f[i]);printf("\n");
	printf("%d\n",f[m]);
}
int main(){
	int t;
	scanf("%d",&t);
	// t=1;                                                                                       
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}