#include <bits/stdc++.h>

using namespace std;

typedef long long i64;

const int maxn = 5e6 + 5;

int n, m, k;
int a[maxn], c[maxn];
i64 suf[maxn], f[maxn];

inline bool check(int x){
	i64 sum = 0;
	for(int i = 1; i <= (n + 1) / 2; ++i){
		int j;
		if(x == 0) j = a[i] + 1;
		else j = (a[i] + x + 1)  / (x + 1);
		sum += suf[j];
	}
	return (sum <= k);
}

inline void solve(){
	scanf("%d%d%d", &n, &m, &k);
	for(int i = 1; i <= n; ++i) scanf("%d", a + i);
	for(int i = 1; i <= m; ++i) scanf("%d", c + i);
	int B = m * 3;
	for(int i = 0; i <= B + 1; ++i) f[i] = 1e18;
	f[1] = 0;
	for(int i = 1; i <= B + 1; ++i){
		for(int j = 1; i * j <= B + 1 && j <= m; ++j){
			f[i * j] = min(f[i * j], f[i] + c[j]);
		}
	}
	suf[B + 1] = 1e18;
	for(int i = B; i >= 1; --i) suf[i] = min(suf[i + 1], f[i]);
	sort(a + 1, a + n + 1);
	int lb = -1, rb = m;
	for(; lb + 1 < rb; ){
		int md = (lb + rb) >> 1;
		if(check(md)) rb = md;
		else lb = md;
	}
	printf("%d\n", rb);
}

int main(){
	int T;
	for(scanf("%d", &T); T--; solve());
	return 0;
}