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

#define int long long

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> a(n);
    for (auto &i : a) {
        cin >> i;
    }
    sort(a.begin(), a.end());
    auto na = a;
    na.resize(unique(na.begin(), na.end()) - na.begin());
    vector<int> b(m + 1);
    for (int i = 1; i <= m; ++i) {
        cin >> b[i];
    }
    vector<int> dp(m * 4 + 1, LLONG_MAX);
    dp[1] = b[1];
    for (int i = 2; i <= m; ++i) {
        dp[i] = min(dp[i], b[i]);
        for (int j = 2; j <= m && i * j < dp.size(); ++j) {
            dp[i * j] = min(dp[i * j], dp[i] + b[j]);
        }
    }
    for (int i = (int)dp.size() - 2; i >= 1; --i) {
        dp[i] = min(dp[i], dp[i + 1]);
    }
    int l = -1, r = m + 1;
    vector<int> make0(m + 1, LLONG_MAX);
    for (auto &i : na) {
        make0[i] = dp[i + 1];
        for (int x = 1; x * x <= i; ++x) {
            {
                int y = i / x - 1;
                while (x * y <= i) ++y;
                make0[i] = min(make0[i], dp[x] + dp[y]);
            }
        }
    }
    while (r - l > 1) {
        int mid = (l + r) / 2;
        if (mid == 0) {
            int sm = 0;
            for (int i = 0; i <= n / 2; ++i) {
                sm += min(make0[a[i]], dp[a[i] + 1]);
            }
            sm <= k ? r = mid : l = mid;
            continue;
        }
        int cnt = 0;
        int sm = 0;
        for (int i = 0; cnt <= n / 2; ++i, ++cnt) {
            if (a[i] <= mid) continue;
            int x = max(2LL, a[i] / mid - 5);
            while (a[i] / x > mid) {
                ++x;
            }
            sm += min({make0[a[i]], dp[a[i] + 1], dp[x]});
        }
        sm <= k ? r = mid : l = mid;
    }
    cout << r << '\n';
}

int32_t main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}