#include <bits/stdc++.h>
typedef long long int ll;
#define endl            '\n'
#define pb             push_back
#define l first
#define r second
#define mp              make_pair
#define pll             pair<ll,ll> 
#define fill(x, y)     memset(x, y, sizeof(x))
#define all(x)         (x).begin(), (x).end()
#define debug(x)       { cerr << #x << " = " << x << endl; }
#define IO	       { ios_base::sync_with_stdio(false); cin.tie(0); }
#define read(x)	       freopen(x, "r", stdin)
#define write(x)       freopen(x, "w", stdout)
#define int long long

using namespace std;

typedef vector<int> vi;
typedef pair<int, int> ii;
 const int INF = 1e18;

bool check(vi &arr, vi &dp, int lim, int k) {
    int n = arr.size();
    int cost = 0, req = (n + 1) / 2;
    for (int i=0; i<req; i++) {
        if (arr[i] > lim) {
            int f = arr[i] + 1;
            if (lim != 0) {
                int x = (arr[i] / lim) - 5;
                for (int j=max(x,1LL); j<max(x,1LL)+10; j++) {
                    if ( (arr[i] / j) <= lim) {
                        f = j;
                        break;
                    }
                }
            }
            cost += dp[f];
            if( cost>k ) return false;
        }
    }
    //cout <<  "Cost = " << cost << endl;
    return cost <= k;
}

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    
    vi arr(n);
    for (int i=0; i<n; i++) cin >> arr[i];

    sort(all(arr));

    vi cost(m+1);
    for (int i=1; i<=m; i++) cin >> cost[i];
    for(int i=m-1;i>0;i--) cost[i] = min(cost[i],cost[i+1]);

    

    vi dp(2*m+1, INF);
    cost[1] = dp[1] = 0;

    for (int i=1; i<=2*m; i++) {
        for (int j=2; i*j<=2*m and j <= m; j++) {
            dp[i*j] = min(dp[i*j], dp[i] + cost[j]);
        }
    }

    // for (int i=1; i<=min(10, 2*m); i++) cout << dp[i] << " ";
    // cout << endl;

    for (int j=2*m-1; j>=1; j--) {
        dp[j] = min(dp[j+1], dp[j]);
    }

    //cout << check(arr, dp, 2, k) << endl;

    int lo = 0, hi = m;
    while(lo < hi) {
        int mid = (lo + hi) / 2;
        if (check(arr, dp, mid, k)) hi = mid;
        else lo = mid + 1;
    }
    cout << lo << endl;
}

signed main(){
    IO;
    int t;
    cin >> t;
    while(t--) 
        solve();

}

/*
3
3 5 0
2 5 2
3 2 4 6 13
3 5 3
2 5 3
3 2 4 6 13
3 5 6
2 5 2
3 2 4 6 13
*/