#include<bits/stdc++.h>
using std::cin;
using std::cout;
const int N = 1000005;
using ll = long long;

int n, m, k;
ll cost[N];
int a[N];
ll eval(int v) {
	ll sum = 0;
	v += 1;
	for(int i = 1;i <= (n + 1) / 2;++i) {
		sum += cost[a[i] / v + 1];
	}
	return sum;
}

int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	int T;
	cin >> T;
	for(int i = 0;i < T;++i) {
		cin >> n >> m >> k;
		for(int i = 1;i <= n;++i) cin >> a[i];
		std::sort(a + 1, a + n + 1);
		for(int j = 1;j <= m;++j) cin >> cost[j];
		cost[1] = 0;
		for(int j = m - 1;j >= 1;--j) {
			cost[j] = std::min(cost[j], cost[j + 1]);
		}
		ll min = 1e18;
		for(int i = 1;i <= m;++i) {
			int j = 1;
			for(;j <= i && i * j <= m;++j) {
				cost[i * j] = std::min(cost[i * j], cost[i] + cost[j]);
			}
			if(i * j > m && j <= m) min = std::min(cost[i] + cost[j], min);
		}
		cost[m + 1] = min;
		for(int i = 1;i <= m;++i) cost[i] = std::min(cost[i], min);
		int l = -1, r = a[n];
		for(;l + 1 < r;) {
			int mid = (l + r) >> 1;
			if(eval(mid) <= k) {
				r = mid;
			} else {
				l = mid;
			}
		}
		cout << r << '\n';
	}
}