#include <bits/stdc++.h>
#define rep(i, j, k) for(int i = j; i <= k; ++ i)
#define per(i, j, k) for(int i = j; i >= k; -- i)
using namespace std;
using ll = long long;
const int N = 1e6 + 10;
int n, m, k;
int a[N], c[N];
ll dp[N];
bool check(int u) { //cnt[<=u] >= (n+1)/2
    ll cost = 0;
    // if(u==0)
        // cerr << "!";
    rep(i, 1, (n + 1) / 2) {
        if(a[i] > u) {
            //2 2 5
            //3 3
            cost += dp[ a[i] / (u + 1) + 1 ];
            if(cost > k)
                return false;
        }
    }
    return true;
}
int main() {
    int test;
    scanf("%d", &test);
    rep(T, 1, test) {
        scanf("%d%d%d", &n, &m, &k);
        rep(i, 1, n) scanf("%d", a + i);
        sort(a + 1, a + n + 1);
        rep(i, 1, m) scanf("%d", c + i);
        per(i, m - 1, 1) c[i] = min(c[i+1], c[i]);
        rep(i, 1, m) dp[i] = c[i];
        dp[m+1] = 1e18;
        rep(i, 1, m) {
            for(int j = 1; j <= m; j ++) {
                int v = min(m + 1, i * j);
                dp[v] = min(dp[v], dp[i] + c[j]);
                if(i * j >= m + 1) break;
            }
        }
        per(i, m, 1) dp[i] = min(dp[i+1], dp[i]);
        // cerr << "dp3 " << dp[3] << endl;
        int l = 0, r = m, ans = m;
        while(l <= r) {
            int mid = (l + r) >> 1;
            if(check(mid)) r = (ans = mid) - 1;
            else l = mid + 1;
        }
        printf("%d\n", ans);
    }    
    return 0;
}