#include <bits/stdc++.h>
#define MULTI int _; cin >> _; while(_--)
#define fi first
#define se second
#define pb(a) push_back(a)
#define rep(i, n) for(int i = 0; i < n; i++)
#define reps(i, n, m) for(int i = n; i <= m; i++)
#define repsv(i, n, m) for(int i = n; i >= m; i--)
#define vsz(a) (int)(a.size())
#define mp(a, b) make_pair(a, b)
#define all(a) a.begin(), a.end()

using namespace std;

typedef pair<double, double> pdd;
typedef pair<int, int> pii;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vll;

#ifdef LOCAL
#include "debugs.hpp"
#else
#define dbg(...) 0
#endif

int n, m, k;
bool ok(int o, vi &a, vi &f){
    int kk = k;
    rep(i, (n+1)/2){
        int d;
        if(o == 0) d = a[i]+1;
        else d = a[i]/o + (a[i]%o ? 1 : 0);
        if(d > m) return false;
        if((kk -= f[d]) < 0)
            return false; 
    }
    return true;
}

void solve(){
    cin >> n >> m >> k;
    vi f(m+1), a(n);
    rep(i, n) cin >> a[i];
    sort(all(a));
    reps(i, 1, m)
        cin >> f[i];
    int mini = INT_MAX;
    repsv(i, m, 1)
        f[i] = mini = min(f[i], mini);
    f[1] = f[0] = 0;
    reps(i, 2, m){
        int j = i;
        while((j+=i) <= m){
            if(j/i <= i)
                f[j] = min(f[j], f[i]+f[j/i]);
        }
    }
    int l = 0, r = 1000000;
    while(r!=l){
        int mid = (l+r)/2;
        if(ok(mid, a, f))
            r = mid;
        else
            l = mid+1;
    }
    cout << l << '\n';
}

int main(){
    ios_base::sync_with_stdio(false);
    MULTI
    solve();
}