#include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
#define maxn 2000005
#define put() putchar('\n')
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
using namespace std;
void read(int &x){
    int f=1;x=0;char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
    while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
    x*=f;
}
namespace Debug{
	Tp void _debug(char* f,Ty t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,Ty x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	Tp ostream& operator<<(ostream& os,vector<Ty>& V){os<<"[";for(auto& vv:V) os<<vv<<",";os<<"]";return os;}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
int power(int x,int y=mod-2) {
	int sum=1;
	while (y) {
		if (y&1) sum=sum*x%mod;
		x=x*x%mod;y>>=1;
	}
	return sum;
}
int n,m,k;
int f[maxn],a[maxn];
const int inf=1e9;
bool check(int val) {
	int sum=0,i;
	for (i=1;i<=n/2+1;i++) if (a[i]>val) sum+=f[(a[i]+val+1)/(val+1)];
//	gdb(sum,k);
	return sum<=k;
}
void solve(void) {
	int i,j,l,r,mid;
	read(n);read(m);read(k);
	for (i=1;i<=n;i++) read(a[i]);
	sort(a+1,a+1+n);
	for (i=1;i<=2*m+1;i++) f[i]=inf;
	for (i=1;i<=m;i++) read(f[i]);f[1]=0;
	for (i=m;i>=1;i--) f[i]=min(f[i],f[i+1]);
	m*=2;
	for (j=2;j<=m;j++) {
		for (i=j;i<=m;i+=j) f[i]=min(f[i],f[i/j]+f[j]); 
	}
	for (i=m;i>=1;i--) f[i]=min(f[i],f[i+1]);//,gdb(i,f[i]);
	l=0,r=m+1;
	while (l+1<r) {
		mid=l+r>>1;
		if (check(mid)) r=mid;
		else l=mid;
	}
	printf("%d\n",r);
}
signed main(void){
	int T;
	read(T);
	while (T--) solve();
	return 0;
}