#include <bits/stdc++.h>
#define ll long long 
using namespace std;

template<typename T>
void read(T &x) {
    int f = 1;
    x = 0;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-')f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = x * 10 + (ch ^ 48);
        ch = getchar();
    }
    x *= f;
}

const int N = 1e6+10;
const ll inf = 1e18;

int n, m, K;
int a[N];
ll M[N];


ll check(int mid) {
    if(mid == a[n/2+1]) return 0;
    if(mid > a[n/2+1]) return -1;
    ll cost = 0;
    int l = lower_bound(a+1, a+1+n, mid+1) - a;
    int cnt = l-1;
    while(cnt < n/2+1) {
        int tmp = (a[l]+1)/(mid+1);
        cost += M[tmp];
        cnt++; l++;
    }
    return cost;
}

vector<vector<int> > G(N);


void solve() {
    read(n);  read(m); read(K);
    for(int i=1; i<=n; i++) read(a[i]);
    for(int i=1; i<=m; i++) read(M[i]);
    
    M[m+1] = inf;
    for(int i=2; i<=m; i++) {
        for(auto j : G[i]) {
            M[i] = min(M[i], M[j] + M[i/j]);
        }
    }

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

    for(int i=2; i<=m; i++) {
        M[m+1] = min(M[m+1], M[i] + M[m/i+1]);
    }
    
    sort(a+1, a+1+n);
    int l = 0, r = a[n/2+1];
    while(l < r) {
        int mid = l + r >> 1;
        ll cost = check(mid);
        if(cost >= 0 && cost <= K) r = mid;
        else l = mid + 1;
    }
    printf("%lld\n", l);
}

signed main() {
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #endif

    for(int i=1; i<=N; i++) {
        for(int j=2; i*j<=N; j++) {
            G[i*j].push_back(i);
        }
    }


    int times = 1;
    read(times);
    while(times--) {
        solve();   
    }
    return 0;
}