#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long 
const int N=1e6+10;
int n,m,k;
int a[N],cost[N],b[N];
bool check(int x){
    int sum=0;
    for(int i=1;i<=(n+1)/2;i++){
        sum+=cost[(a[i]+1+x)/(x+1)];
        // cout<<a[i]<<" ";
        if(sum>k) return 0;
    }
    // cout<<endl;
    // cout<<sum<<"__\n";
    return sum<=k;
}
void solve(){
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=m;i++) cin>>cost[i];
    sort(a+1,a+1+n);    
    if(k==0){cout<<a[(n+1)>>1]<<"\n";return;}
    b[m]=cost[m];cost[1]=0;
    for(int i=m-1;i>0;i--) {cost[i]=min(cost[i],cost[i+1]);b[i]=cost[i];}
    for(int i=2;i<=m;i++){
        for(int j=1;j*i<=m;j++)
            b[i*j]=min(b[i*j],b[i]+b[j]);
    }
    for(int i=m-1;i>0;i--) {b[i]=min(b[i],b[i+1]);cost[i]=b[i];}
    cost[m]=b[m];
    cost[1]=0;
    // for(int i=1;i<=m;i++) cout<<cost[i]<<" ";cout<<endl;
    int l=0,r=a[n];
    int ans=l;
    while(l<r){
        // cout<<"--\n";
        int mid=l+r>>1;
        if(check(mid)) {r=mid;}
        else {l=mid+1;}
        // cout<<l<<" "<<r<<endl;
    }
    cout<<r<<"\n";
    return;
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t;cin>>t;
    while(t--){
        // cout<<"-___\n";
        solve();
    }
    return 0;
}
/*
5
7
13
4 8 13 18 6
2 3 6 8 4 2 4

5 6 4
7 98 56 34 22
5 2 7 5 2 3 4
*/