#include <bits/stdc++.h>

using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr)
#define rep(a, b, c) for(int (a)=(b);(a)<=(c);(a)++)
#define per(a, b, c) for(int (a)=(b);(a)>=(c);(a)--)
#define mset(var, val) memset(var,val,sizeof(var))
#define ll long long
#define int ll
#define fi first
#define se second
#define no "NO\n"
#define yes "YES\n"
#define Alice cout<<"Alice\n"
#define Bob cout<<"Bob\n"
#define pb push_back
#define endl "\n"
#define pii pair<int,int>
#define pll pair<ll,ll>

#define dbg(x...) do{cout<<#x<<" -> ";err(x);}while (0)

const int N = 1e6 + 5;
const int inf = 1e18;

int a[N],cost[N << 1];
int n,m,k;

bool check(int x){
    int sum=0;
    if(x==0){
        rep(i,1,(n+1)/2){
            if(a[i]>x)
                sum+=cost[a[i] + 1];
        }
    }else{
        rep(i,1,(n+1)/2){
            if(a[i]>x)
                sum+=cost[(a[i] + x - 1) / x];
        }
    }
    if(sum<=k)
        return true;
    return false;
}

void solve() {
    cin>>n>>m>>k;
    rep(i,1,n)
        cin>>a[i];
    sort(a+1,a+1+n);
    rep(i,1,m)
        cin >> cost[i];
    per(i,m-1,1)
        cost[i]=min(cost[i], cost[i + 1]);
    cost[1]=0;
    cost[m+1]=inf;
    for(int i=2;i<=m;i++){
        int t=1;
        for(int j=1;j*i<=m;j++,t++){
            cost[i * j]=min(cost[i * j], cost[i] + cost[j]);
        }
        cost[m+1]=min(cost[m+1],cost[i]+cost[t]);
    }
    per(i,m,1)
        cost[i]=min(cost[i], cost[i + 1]);
    int l=0,r=a[(n+1)/2],ans=r;
    while(l<=r){
        int mid=(l+r)>>1;
        if(check(mid)){
            ans=mid;
            r=mid-1;
        }else{
            l=mid+1;
        }
    }
    cout<<ans<<endl;
}

signed main() {
    IOS;
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}