#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr)

const int N = 1e6 + 5;

int n, m, k, a[N], c[N];

bool check(int x) {
    int cnt = 0;
    for(int i = 1; i <= n; i++) if(a[i] > x) {
        if(x == 0) cnt += c[a[i]+1];
        else cnt += c[(a[i]-1)/x+1];
    }
    return cnt <= k;
}

void solve() {
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++) cin >> a[i];
    sort(a+1, a+1+n);
    n = (n+1)/2;
    for(int i = 1; i <= m; i++) cin >> c[i];
    c[m+1] = c[1]+c[m];
    for(int i = m; i > 0; i--) c[i] = min(c[i], c[i+1]);
    for(int i = 1; i <= m+1; i++) {
        for(int j = i; j <= m; j++) {
            if(i*j > 2*m) break;
            if(i*j > m) c[m+1] = min(c[i]+c[j], c[m+1]);
            c[i*j] = min(c[i]+c[j], c[i*j]);
        }
    }
    for(int i = m; i > 0; i--) c[i] = min(c[i], c[i+1]);
    int l = 0, r = a[n], ans = a[(n+1)/2];
    while(l<=r) {
        int mid = (l+r)>>1;
        if(check(mid)) r = mid-1, ans=mid;
        else l = mid+1;
    }
    printf("%d\n", ans);
}

signed main() {
    IOS;
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}