#include<bits/stdc++.h>
#define ll long long
#define SD ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define flot(n) cout << setprecision(n) << setiosflags(ios::fixed) << setiosflags(ios::showpoint)
#define all(a) (a).begin() , (a).end()
#define F first
#define S second
#define pii pair<int,int>
#define pb push_back
#define piii pair<pii,int>
#define endl '\n'
//#define int ll
using namespace std;
void readFromFile(string input = "input.txt",string output="output.txt") {
    #ifndef ONLINE_JUDGE
        freopen(input.c_str(),"r",stdin);
        freopen(output.c_str(),"w",stdout);
    #endif
}
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll x, ll y) {
    return uniform_int_distribution<ll>(x, y)(rng);
}
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const long double EPS = 1e-6;
const long double pi = acos(-1.0);
const int mod=1e9+7;
const int N = 1e6+5;
const int sq = 500;
int n,m,k,a[N],c[N];
bool can(int mid) {
    int cost=0;
    for(int i = 0 ; i <= n/2 ; i++) {
        if(a[i] <= mid) continue;
        int l = 1 , r = m , mid2 , ans;
        cost += c[a[i]/(mid+1)+1];
        if(cost > k) return 0;
    }
    return 1;
}
void solve() {
    cin >> n >> m >> k;
    for(int i = 0 ; i < n ; i++) {
        cin >> a[i];
    }
    sort(a,a+n);
    for(int i = 1 ; i <= m ; i++) {
        cin >> c[i];
    }
    for(int i = m-1 ; i >= 1 ; i--) {
        c[i] = min(c[i],c[i+1]);
    }
    for(int i = 1 ; i <= m ; i++) {
        for(int j = i ; j <= m ; j += i) {
            c[j] = min(c[j],c[i]+c[j/i]);
        }
    }
    for(int i = m-1 ; i >= 1 ; i--) {
        c[i] = min(c[i],c[i+1]);
    }
    int t = 0;
    vector<int> cst(n);
    for(int i = 0 ; i < n ; i++) {
        int sq = sqrt(a[i]) , cr;
        if(a[i]/sq/sq == 0) cr = c[sq] + c[sq];
        else if(a[i]/(sq+1)/sq == 0) cr = c[sq] + c[sq+1];
        else cr = c[sq+1]+c[sq+1];
        if(a[i] < m) cr = min(cr,c[a[i]+1]);
        cst[i] = cr;
    }
    sort(all(cst));for(int i = 0 ; i <= n/2 ; i++) {
        t += cst[i];
    }
    if(t <= k) {
        cout << 0 << endl;
        return;
    }
    int l = 1 , r = m , mid , ans;
    while(l <= r) {
        mid = (l+r)/2;
        if(can(mid)) {
            ans = mid;
            r = mid-1;
        }else l = mid+1;
    }
    cout << ans << endl;
}
int main() {
//cout << int(1e6*log2(1e6)*log2(1e6)) << endl;
//    readFromFile();
    SD;
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
}