#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];ll w[N];
pair<int,ll> B[100];int Bh;
int CK(int mid){
	ll tot=0;
	for(int i=1;i<=(n+1)/2;i++){
		if(mid==0) tot+=w[A[i]+1];
		else tot+=w[(A[i]+mid-1)/mid];
	}
	// cerr<<mid<<' '<<tot<<'\n';
	return tot<=k;
}
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("%lld",&w[i]);w[1]=0;
	sort(A+1,A+n+1);w[m+1]=INF;
	ll Mi=INF;int R=m+1;
	for(i=2;i<=m;i++){
		if(1ll*i*i>m){
			Mi=min(Mi,w[i]);
			R=min(R,i);
			while(1ll*R*i>m) Mi=min(Mi,w[R]),R--;
		} 
		for(j=1;j<=R;j++) w[j*i]=min(w[j*i],w[j]+w[i]);
		w[m+1]=min(w[m+1],Mi+w[i]);
	}
	for(i=m;i;i--) w[i]=min(w[i],w[i+1])/*,cerr<<w[i]<<' '*/;
	int l=-1,r=m+1,mid;
	while(l+1<r) mid=l+r>>1,(CK(mid)?r:l)=mid;
	printf("%d\n",r);
}
int main(){
	int t;
	scanf("%d",&t);
	// t=1;                                                                                       
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}