#include<bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(v) ((int)v.size())
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define umap unordered_map
using namespace std;
namespace qiqi {
	const ll inf = 1e18;
	void main() {
		ll n,m,k;
		cin >> n >> m >> k;
		vll a(n),c(m+1);
		for (int i = 0; i < n; i++) {
			cin >> a[i];
		}
		sort(all(a)); n = n/2+1;
		a.erase(a.begin()+n,a.end());
		for (int i = 1; i <= m; i++) {
			cin >> c[i];
		}
		vll f(m+2,inf); f[1] = 0;
		for (int j = 1; j <= m; j++) {
			for (int i = j; i <= m; i += j) {
				f[i] = min(f[i],f[i/j]+c[j]);
			}
		}
		for (ll i = 1,p = m,mn = inf; i <= m; i++) {
			while (i*p > m) {
				mn = min(mn,f[p]);
				p--;
			}
			f[m+1] = min(f[m+1],mn+c[i]);
		}
		for (int i = m; i >= 1; i--) {
			f[i] = min(f[i],f[i+1]);
		}
		auto chk = [&](int p) {
			ll sum = 0;
			for (int i = 0; i < n; i++) {
				sum += f[a[i]/(p+1)+1];
			}
			return sum <= k;
		};
		int l = -1,r = m+1;
		while (r-l > 1) {
			int mid = l+((r-l)>>1);
			chk(mid) ? r = mid : l = mid;
		}
		cout << r << '\n';
	}
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int T; cin >> T;
	while (T--) qiqi::main();
	return 0;
}