#include<bits/stdc++.h>
#define ll long long
#define int long long

using namespace std;

const int N = 1e6 + 1000;

int a[N], cost[N];
int n, m;
ll k;
int f[N];

bool ck(int mid)
{
	ll sum = 0;
	for(int i = 1; i <= (n + 1) / 2; i++)
	{
		if(a[i] <= mid) continue;
		int tmp = 0;
		if(mid == 0) tmp = a[i] + 1;
		else tmp = (a[i] + mid - 1) / mid;
		sum += f[tmp];
	}
	// cout << sum << endl;
	if(sum > k) return 0;
	else return 1;
}

signed main()
{
	int t;
	cin >> t;
	while(t--)
	{
		cin >> n >> m >> k;
		for(int i = 1; i <= n; i++)
			cin >> a[i];
		for(int i = 1; i <= m; i++)
		{
			cin >> cost[i];
			f[i] = cost[i];
		}
		f[1] = 0, f[m + 1] = 1e18;
		
		sort(a + 1, a + 1 + n);

		for(int i = m; i >= 1; i--)
			f[i] = min(f[i], f[i + 1]);

		for(int i = 1; i <= m; i++)
		{
			for(int j = 1; j * i <= m; j++)
				f[i * j] = min(f[i * j], f[i] + f[j]);
		}

		for(int i = m; i >= 1; i--)
			f[i] = min(f[i], f[i + 1]);

		int l = 0, r = 1e18;
		while(l < r)
		{
			int mid = (l + r) / 2;
			// cout << mid << endl;
			if(ck(mid)) r = mid;
			else l = mid + 1;
		}
		cout << l << endl;
	}

	return 0;
}