#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int N, M, K;
    std::cin >> N >> M >> K;
    
    std::vector<int> A(N);
    for (int i = 0; i < N; i++) {
        std::cin >> A[i];
    }
    std::vector<int> cost(M + 2);
    for (int i = 1; i <= M; i++) {
        std::cin >> cost[i];
    }
    cost[M + 1] = K + 1;
    cost[1] = 0;
    for (int i = 1; i <= M; i++) {
        for (int j = 1; ; j++) {
            if (i * j <= M) {
                cost[i * j] = std::min(cost[i * j], cost[i] + cost[j]);
            } else {
                cost[M + 1] = std::min(cost[M + 1], cost[i] + cost[j]);
                break;
            }
        }
    }
    for (int i = M; i >= 1; i--) {
        cost[i] = std::min(cost[i], cost[i + 1]);
    }
    std::sort(A.begin(), A.end());
    
    auto ans = *std::ranges::partition_point(std::ranges::iota_view(0, M),
        [&](int x) {
            i64 tot = 0;
            for (int i = 0; i <= N / 2; i++) {
                tot += cost[A[i] / (x + 1) + 1];
            }
            return tot > K;
        });
    std::cout << ans << "\n";
}

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