#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 1e6 + 5;
const int inf = 0x3f3f3f3f;

int n,m,d;
int a[MAXN], c[MAXN];

bool check(int lim)
{
	ll sum = 0;
	for(int i=1; i<=n/2+1; ++i)
		sum += c[a[i] / (lim + 1) + 1];
	return sum <= d;
}

void solve(void)
{
	scanf("%d%d%d",&n,&m,&d);
	for(int i=1; i<=n; ++i)
		scanf("%d",&a[i]);
	for(int i=1; i<=m; ++i)
		scanf("%d",&c[i]);
	
	c[1] = 0; c[m+1] = inf * 2;
	for(int i=m; i>=1; --i)
		c[i] = min(c[i], c[i+1]);
	
	for(int i=1; i<=m; ++i)
	{
		int j = 1;
		for(; i*j<=m; ++j)
			c[i*j] = min(c[i*j], c[i] + c[j]);
		c[m+1] = min(c[m+1], c[i] + c[j]);
	}
			
	for(int i=m; i>=1; --i)
		c[i] = min(c[i], c[i+1]);
	
	sort(a+1, a+n+1);
	
	int l = 0, r = a[n/2+1];
	while(l<r)
	{
		int mid = (l+r)>>1;
		if(check(mid)) r = mid;
		else l = mid+1;
	}
	printf("%d\n",l);
}

int main(void)
{
	int T;
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}