#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 int long long
using namespace std;
inline int read()
{
	char c=getchar();int 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;
}

#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 2000005
#define inf 0x3f3f3f3f

int n,m,k,a[maxn];
int w[maxn];

int t[maxn];
int chk(int mid){
	int res=0;
	For(i,1,(n+1)/2){
		if(a[i]<=mid);
		else res+=w[(a[i]/(mid+1))+1];
	}
//	cout<<"chk "<<mid<<" "<<res<<"\n";
	return res; 
}

void work()
{
	n=read(),m=read(),k=read();
	For(i,1,n) a[i]=read();
	For(i,1,m) w[i]=read();
	w[m+1]=inf; w[1]=0;
	Rep(i,m-1,1) w[i]=min(w[i],w[i+1]);
	For(i,2,m){
		For(j,2,m/i)
			w[i*j]=min(w[i*j],w[i]+w[j]);
		w[m+1]=min(w[m+1],w[i]+w[m/i+1]);
	}
	Rep(i,m,1) w[i]=min(w[i],w[i+1]);

//	For(i,1,m+1) cout<<w[i]<<" ";puts("");
//s	For(i,0,(a[(n+1)/2])) cout<<chk(i)<<" ";puts("");
	
	sort(a+1,a+n+1);
	int l=0,r=a[(n+1)/2],res=r;
	while(l<=r){
		int mid=l+r>>1;
		if(chk(mid)<=k)res=mid,r=mid-1;
		else l=mid+1;
	}
	cout<<res<<"\n"; 
}

signed main()
{
	int T=read();
	while(T--)work();
	return 0;
}