#include <bits/stdc++.h>
#define int long long

const int N = 1e6 + 4;
int n, m, k, a[N], c[N];

void solve() {
    std::cin >> n >> m >> k;
    for(int i = 1; i <= n; ++i) std::cin >> a[i];
    for(int i = 1; i <= m; ++i) std::cin >> c[i];
    std::sort(a + 1, a + n + 1);
    c[m + 1] = 2e9;
    for(int i = 1; i <= m; ++i) {
        int t = 2;
        for(int j = i * 2; j <= m; j += i, ++t) {
            c[j] = std::min(c[j], c[i] + c[t]);
        }
        c[m + 1] = std::min(c[m + 1], c[i] + c[t]);
    }
    // for(int i = 1; i <= m; ++i) std::cout << c[i] << " \n"[i == m];
    for(int i = m; i >= 1; --i) c[i] = std::min(c[i], c[i + 1]);
    auto check = [&](int mid) -> bool {
        long long re = 0;
        for(int i = 1; i <= n / 2 + 1; ++i) {
            if(a[i] > mid) re += c[a[i] / (mid + 1) + 1];
        }
        return re <= k;
    } ;
    int l = 0, r = a[n / 2 + 1];
    while(l < r) {
        int mid = (l + r) >> 1;
        if(check(mid)) {
            r = mid;
        } else {
            l = mid + 1;
        }
    }
    std::cout << r << '\n';
}

signed main() {
    std::cin.tie(nullptr) -> sync_with_stdio(false);
    int T;
    std::cin >> T;
    while(T--) solve();
    return 0;
}