#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define N 1000010
#define inf 0x3f3f3f3f
#define LL long long
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define drep(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int rd() {
	int res=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') f*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') res=(res<<1)+(res<<3)+(ch^48),ch=getchar();
	return res*f;
}
int T,n,m,K,a[N];
LL dp[N];
bool check(int mid) {
	LL res=0;
	rep(i,1,(n+1)/2) if(a[i]>mid) {
		res+=dp[a[i]/(mid+1)+1];
	}
	return res<=K;
}
void Deal_first() {
	rep(i,1,m) {
		rep(j,1,sqrt(i)) {
			if(i%j==0) {
				dp[i]=min(dp[i],dp[j]+dp[i/j]);
			}
		}
	}
	for(int i=1,j=m;i<=m;i++) {
		while(1ll*i*(j-1)>m) j--;
		if(i*j>m)dp[m+1]=min(dp[m+1],dp[i]+dp[j]);
	}
	drep(i,m,1) dp[i]=min(dp[i],dp[i+1]);
}
int main() {
//	freopen("B.in","r",stdin);
//	freopen("B.out","w",stdout);
	T=rd();
	while(T--) {
		n=rd(),m=rd(),K=rd();
		rep(i,1,n) a[i]=rd();
		sort(a+1,a+n+1);
		rep(i,1,m) dp[i]=rd();
		dp[m+1]=inf;
		drep(i,m,1) dp[i]=min(dp[i],dp[i+1]);
		Deal_first();
		int l=0,r=a[(n+1)/2],mid;
		while(l<r) {
			mid=l+r>>1;
			if(check(mid)) r=mid;
			else l=mid+1;
		}
		printf("%d\n",l);
	}
	return 0;
}