#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n, m, k;
    std::cin >> n >> m >> k;

    std::vector<int> a(n), cost(m + 2);
    for (int i = 0; i < n; i ++ ) {
        std::cin >> a[i];
    }
    std::sort(a.begin(), a.end());

    for (int i = 1; i <= m; i ++ ) {
        std::cin >> cost[i];
    }
    cost[1] = 0;
    cost[m + 1] = k + 1;
    for (int i = m; i; i -- ) {
        cost[i] = std::min(cost[i], cost[i + 1]);
    }

    std::vector<int> dp(m + 2);
    for (int i = 1; i <= m + 1; i ++ ) {
        dp[i] = cost[i];
    }
    for (int i = 1; i <= m; i ++ ) {
        for (int j = 1; i * j <= m + 1; j ++ ) {
            dp[i * j] = std::min(dp[i * j], dp[i] + dp[j]);
        }
    }

    int lo = 0, hi = m;
    while (lo < hi) {
        int x = (lo + hi) / 2;

        i64 tot = 0;
        for (int i = 0; i < (n + 1) / 2; i ++ ) {
            tot += dp[(a[i] + x + 1) / (x + 1)];
        }

        if (tot <= k) {
            hi = x;
        } else {
            lo = x + 1;
        }
    }

    std::cout << hi << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t -- ) {
        solve();
    }

    return 0;
}