#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> A(n);
    for (int i = 0; i < n; ++i)
        cin >> A[i];
    sort(A.begin(), A.end());
    vector<int> cost(m + 1);
    for (int i = 1; i <= m; ++i)
        cin >> cost[i];
    vector<int> suff_min(m + 1);
    suff_min[m] = cost[m];
    for (int i = m - 1; i >= 1; --i)
        suff_min[i] = min(suff_min[i + 1], cost[i]);
    vector<int> real_cost(m + 2, 1e9 + 228);
    real_cost[1] = 0;
    for (int i = 1; i <= m + 1; ++i) {
        int x = 1;
        for (; i * x <= m + 1 && x <= m; ++x) {
            real_cost[i * x] = min(real_cost[i * x], real_cost[i] + cost[x]);
        }
        if (x <= m)
            real_cost[m + 1] = min(real_cost[m + 1], real_cost[i] + suff_min[x]);
    }
    for (int i = m; i >= 1; --i)
        real_cost[i] = min(real_cost[i], real_cost[i + 1]);
    int left = -1, right = m;
    while (right - left > 1) {
        int mid = (left + right) / 2;
        long long need = 0;
        for (int i = 0; i < (n + 1) / 2; ++i) {
            if (A[i] > mid)
                need += real_cost[mid == 0 ? A[i] + 1 : (A[i] + mid - 1) / mid];
        }
        if (need > k)
            left = mid;
        else
            right = mid;
    }
    cout << right << '\n';
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}