#include <bits/stdc++.h>
using namespace std;
inline int read()
{
	char ch;
	while((ch=getchar())<'0'||ch>'9');
	int res=ch-'0';
	while((ch=getchar())>='0'&&ch<='9') res=res*10+ch-'0';
	return res;
}	
const int M=1001000;
int n,m,K,c[M<<1],a[M];
int nn;
bool check(int x)
{
	int sum=0;
	for(int i=1;i<=nn;i++)
	{
		if(a[i]>x)
		{
			int tmp=a[i]/(x+1)+1;
			sum+=c[tmp];
			if(sum>K) break;
		}
	}
	return sum<=K;
}
int main()
{
	int t=read();
	while(t--)
	{
		n=read();m=read();K=read();
		nn=(n+1)/2;
		for(int i=1;i<=n;i++) a[i]=read();
		sort(a+1,a+1+n);
		for(int i=1;i<=m;i++) c[i]=read();
		for(int i=1;i<=m;i++) c[i+m]=1e9;
		m<<=1;
		c[1]=0;
		for(int i=m-1;i>=1;i--) c[i]=min(c[i],c[i+1]);
		for(int i=2;i<=(m>>1);i++)
			for(int j=i<<1,k=2;j<=m;j+=i,k++)
			c[j]=min(c[j],c[i]+c[k]);
		int L=0,R=a[nn];
		while(L<=R)
 		{
 			int mid=L+R>>1;
			if(check(mid)) R=mid-1;
			else L=mid+1;	
		}
		printf("%d\n",R+1);
	}
	return 0;
}