#include<bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

using ll = long long;

const int N = 2e6 + 5;
int n, m, k;
int ls[N];
vector<int> pr;
ll c[N], a[N];

int divup(int x, int y) {
    return (x + y - 1) / y;
}

ll check(int x) {
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        //cout << divup(a[i] + 1, x + 1) << ' ';
        if (c[divup(a[i] + 1, x + 1)] == 2e18)
            return 2e18;
        // cout << divup(a[i] + 1, x + 1) << ' ';
        ans += c[divup(a[i] + 1, x + 1)];
    }
    // cout << '\n';
    return ans;
}

void solve() {
    cin >> n >> m >> k;
    ll x = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    sort(a, a + n);

    n -= n / 2;

    for(int i =0; i < n; i++){
        x = max(x, a[i]);
    }

    for (int i = 1; i <= m; i++) {
        cin >> c[i];
    }
    c[1] = 0;
    for (int i = m - 1; i > 0; i--) {
        c[i] = min(c[i], c[i + 1]);
    }
    for (int i = m + 1; i <= m * 2; i++) {
        c[i] = 2e18;
    }
    for (int i = 2; i <= m * 2; i++) {
        c[i] = min(c[i], c[i / ls[i]] + c[ls[i]]);
    }

    for (int i = m * 2 - 1; i > 0; i--) {
        c[i] = min(c[i], c[i + 1]);
    }

   /* for (int i = 0; i <= m; i++) {
        cout << check(i) << '\n';
    }*/
    int l = -1, r = N;
    while (r - l > 1) {
        int mid = (l + r) >> 1;
        if (check(mid) <= k)
            r = mid;
        else
            l = mid;
    }

    cout << r << '\n';

    // cout << "_________\n";
}

int main() {
#ifndef LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#else
    freopen("input.txt", "r", stdin);
#endif
    for (int i = 2; i < N; i++) {
        if (ls[i] == 0) {
            ls[i] = i;
            pr.push_back(i);
        }
        for (int j = 0; j < sz(pr) && 1LL * pr[j] * i < N && pr[j] <= ls[i]; j++) {
            ls[pr[j] * i] = pr[j];
        }
    }
    int t;
    cin >> t;
    while (t--)
        solve();
    return 0;
}