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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define subnb true
#define Lnb true
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

const int N = (int)1e6 + 50;
const int INF = (int)2e9 + 50;

int n, m, k;
ll a[N], c[N];

bool check(int median) {
    ll res = 0;
    rep(i, 0, (n + 1) / 2) {
        // make a[i] <= median
        if(a[i] <= median) continue;
        // floor(a[i] / x) <= y
        int l = 0, r = m + 1, mid;
        while(l + 1 < r) {
            mid = (l + r) / 2;
            if(a[i] / mid <= median) r = mid;
            else l = mid;
        }
//        cout << i << ": " << r << endl;
        res += c[r];
    }
    return res <= k;
}

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

    int T;
    cin >> T;
    while(T--) {
        cin >> n >> m >> k;
        rep(i, 0, n) cin >> a[i];
        rep(j, 1, m + 1) cin >> c[j];
        c[m + 1] = INF;
//        cout << c[m + 1] << endl;
        for (int i = m; i >= 1; i--) c[i] = min(c[i], c[i + 1]);
//        rep(i, 1, m + 2) cout << c[i] << " ";
//        cout << endl;
        for (int i = 1; i <= m + 1; i++) {
            for (int j = 2; j <= m + 1; j++) {
                c[min(i * j, m + 1)] = min(c[min(i * j, m + 1)], c[i] + c[j]);
                if(i * j > m + 1) break;
            }
        }
        for (int i = m; i >= 1; i--) c[i] = min(c[i], c[i + 1]);
//        rep(i, 1, m + 2) cout << c[i] << " ";
//        cout << endl;
        sort(a, a + n);
//        cout << check(0) << endl;
        int l = -1, r = m, mid;
        while(l + 1 < r) {
            mid = (l + r) / 2;
            if(check(mid)) r = mid;
            else l = mid;
        }
        cout << r << '\n';
    }
}