#include<bits/stdc++.h>
#include <vector>

#define range(x) begin(x), end(x)

using namespace std;

typedef long long ll;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--) {
        int n, m, k;
        cin >> n >> m >> k;
        vector<int> a(m + 1);
        vector<int> tmp;
        vector<int> c(m + 1);
        for (int i = 0; i < n; i++) {
            int u;
            cin >> u;
            tmp.push_back(u);
        }
        sort(tmp.begin(),tmp.end());
        for (int i = 0; i <= n / 2; i++) {
            a[tmp[i]]++;
        }
        for (int i = 1; i <= m; i++) {
            cin >> c[i];
        }
        auto check = [&](int mid) {
            vector<ll> cost(m + 1, 1e18);
            cost[mid] = 0;
            for (int i = mid; i <= m; i++) {
                for (int j = 1; j <= m; j++) {
                    ll up = min(m, i * j + j - 1);
                    cost[up] = min(cost[up], cost[i] + c[j]);
                    if (i * j + j - 1 >= m)break;
                }
            }
            for (int i = m - 1; i >= mid; i--) {
                cost[i] = min(cost[i + 1], cost[i]);
            }

            ll tot_cost = 0;
            for (int i = mid; i <= m; i++) {
                tot_cost += ((ll) a[i] * cost[i]);
            }
            return tot_cost <= k;
        };


        int l = 0, r = m;

        while (l < r - 1) {
            int mid = (l + r) / 2;
            if (check(mid)) {
                r = mid;
            } else {
                l = mid;
            }
        }

        if (check(l)) r = l;
        cout << r << "\n";
    }

    return 0;
}