#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		
		int n,m,k;
		scanf("%d%d%d",&n,&m,&k);
		vector<int>a(n+1),cost(m+1);
		for(int i=1;i<=n;i++)scanf("%d",&a[i]);
		sort(a.begin()+1,a.begin()+1+n);
		for(int i=1;i<=m;i++)scanf("%d",&cost[i]);
		cost[1]=0;
		vector<int>maxx(m+1);
		maxx[m]=cost[m];
		for(int i=m-1;i>=1;i--)maxx[i]=min(maxx[i+1],cost[i]);

		vector<ll>dp(m+2,1e18);
		dp[1]=0;
		for(int i=1;i<=m;i++){
			dp[i]=min(dp[i],1ll*maxx[i]);
			for(int j=2;1ll*i*j<=m;j++){
				dp[i*j]=min(dp[i*j],dp[i]+maxx[j]);
			}
		}
		for(int i=m-1;i>=1;i--)dp[i]=min(dp[i],dp[i+1]);
		for(int i=1;i<=m;i++){
			if(m/i+1<=m)dp[m+1]=min(dp[m+1],dp[i]+dp[m/i+1]);
		}
		for(int i=m;i>=1;i--)dp[i]=min(dp[i],dp[i+1]);
			
		//for(int i=1;i<=m+1;i++)printf("dp[%d]=%d\n",i,dp[i]);
		auto check=[&](int mid){
			ll ans=0;
			for(int i=1;i<=n/2+1;i++){
				if(mid>=a[i])continue;
				else if(mid==0)ans+=dp[a[i]+1];
				else ans+=dp[(a[i]-1)/mid+1];
			}
			//printf("%d %lld\n",mid,ans);
			if(ans<=k)return true;
			return false;
		};
		int l=0,r=1e9;
		while(l<r){
			int mid=(l+r)>>1;
			if(check(mid)){
				r=mid;
			}else{
				l=mid+1;
			}
		}
		printf("%d\n",l);
	}
	return 0;
}