#include <bits/stdc++.h>

using namespace std;
using PII = pair<int,int>;
using ll = long long;

constexpr int N = 2e6 + 10;

ll w[N];
ll c[N];
int n, m, k;

bool check(ll u) {
	ll cur = 0;
	if(u == 0) {
		for(int i = 1; i <= n / 2 + 1; i ++) {
			cur += c[w[i] + 1];
		}
	}
	else {
		for(int i = 1; i <= n / 2 + 1; i ++) {
			cur += c[(w[i] + u - 1) / u];
		}
	}
	return cur <= k;
}

void solve() {
	cin >> n >> m >> k;
	for(int i = 1; i <= n; i ++) {
		cin >> w[i];
	}
	memset(c, 0x3f, sizeof c);
	for(int i = 1; i <= m; i ++) {
		cin >> c[i];
	}
	for(int i = 1; i <= m + 10; i ++) {
		for(int j = 1; i * j <= m + 10; j ++) {
			c[i * j] = min(c[i * j], c[i] + c[j]);
		}
	}
	for(int i = m - 1; i >= 1; i --) {
		c[i] = min(c[i], c[i + 1]);
	}
	c[1] = 0;
	sort(w + 1, w + 1 + n);
	ll l = 0, r = 2;
	while(r > l) {
		ll mid = (l + r) >> 1;
		if(check(mid)) {
			r = mid;
		}
		else l = mid + 1;
	}
	cout << l << "\n";
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t;
	t = 1;
	cin >> t;
	while(t --){
		solve();
	}
}