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

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int t;
    cin >> t;

    auto 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());
        a.erase(a.end() - n / 2, a.end());

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

        constexpr i64 inf = 1e18;
        vector<i64> dp(2 * m + 1, inf);
        dp[1] = 0;

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

        int ans = *ranges::partition_point(ranges::iota_view(0, m), [&](int x) {
            i64 res = 0;
            for (auto a : a) {
                int y = a / (x + 1) + 1;
                res += cost[y];
            }
            return res > k;
        });
        cout << ans << '\n';
    };

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