#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int const maxn = 1e6 + 5;
ll a[maxn], dp[maxn], cost[maxn], inf = 1e18 + 7, suff[maxn];

ll get(int n, int value) {
    int middle = (n + 1) / 2;
    ll answer = 0;
    for (int i = 1; i <= middle; i++) {
        if (a[i] <= value) continue;
        int cnt;
        cnt = (a[i] + value + 1) / (value + 1);
        assert(a[i] / cnt <= value);
        answer += dp[cnt];
        answer = min(answer, inf);
    }
    return answer;
}

main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--) {
        int n, m, k;
        cin >> n >> m >> k;
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
        }
        for (int i = 1; i <= m; i++) {
            cin >> cost[i];
            dp[i] = cost[i];
        }
        sort(a + 1, a + n + 1);
        dp[1] = 0;
        dp[m + 1] = inf;
        suff[m] = cost[m];
        for (int i = m - 1; i >= 1; i--) suff[i] = min(suff[i + 1], cost[i]);
        for (int i = 1; i <= m; i++) {
            for (int j = i; j <= m; j += i) {
                dp[j] = min(dp[j], dp[i] + cost[j / i]);
            }
        }
        for (int i = m; i >= 1; i--) {
            dp[i] = min(dp[i], dp[i + 1]);
        }
        ll value = inf;
        for (int i = 2; i <= m; i++) {
            int v = (m + i) / i;
            value = min(value, dp[i] + suff[v]);
            dp[i] = min(dp[i], value);
        }
        dp[m + 1] = value;
        for (int i = m; i >= 1; i--) {
            dp[i] = min(dp[i], dp[i + 1]);
        }
        int lef = -1, righ = m + 1;
        while (righ - lef > 1) {
            int mid = (righ + lef) / 2;
            if (get(n, mid) <= k) righ = mid;
            else lef = mid;
        }
        cout << righ << '\n';
    }
    return 0;
}