#include <bits/stdc++.h>

#define _debugVar(x) { cerr << #x << " = " << x << endl; }

using namespace std;
using LL = long long;

const int N = 2e6+5;
const LL INF = 0x3f3f3f3f3f3f3f3f;

int n, m, K;
int a[N];
LL cost[N];

bool check(int t)
{
	LL res = 0;
	for(int i = 1; i <= (n+1)/2; i++) {
		if(a[i] <= t) continue;
		if(t == 0) res += cost[a[i]+1];
		else {
			int x = a[i]/t;
			if(a[i]%t) x++;
			res += cost[x];
		}
	}
	return (res <= K);
}

int main()
{
	// freopen("1.in", "r", stdin);
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int T; cin >> T;
	while(T--) {
		cin >> n >> m >> K;
		for(int i = 1; i <= n; i++) 
			cin >> a[i];
		sort(a+1, a+n+1);
		for(int i = 1; i <= m; i++) 
			cin >> cost[i];

		for(int i = m+1; i <= 2*m; i++) 
			cost[i] = INF;

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

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

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

		int L = -1, R = m;
		while(L+1 < R) {
			int mid = (L+R)/2;
			if(check(mid)) R = mid;
			else L = mid;
		}
		printf("%d\n", R);
	}
	return 0;
}