#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
#define Yes cout<<"YES\n"
#define No  cout<<"NO\n"
#define all(a) a.begin(),a.end()
#define pb push_back
#define endl '\n'
//#define int ll
const ll mod=1e9+7;const int M=2e6+5;const int N=1e6+5;const int inf=1e9+10;
int dx[] = {-1, 1, 0, 0};int dy[] = {0, 0, -1, 1};
int a[N],f[M];
void solve()
{
    int n,m,k;cin>>n>>m>>k;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int j=1;j<=m;j++){
        cin>>f[j];
    }
    for(int j=m-1;j>0;j--){
        f[j]=min(f[j],f[j+1]);
    }
    for(int j=m+1;j<=2*m;j++){
        f[j]=inf;
    }
    for(int i=1;i<=m;i++){
        for(int j=2*i;j<=2*m;j+=i){
            f[j]=min(f[j],f[i]+f[j/i]);
        }
    }
    for(int i=2*m-1;i>0;i--){
        f[i]=min(f[i],f[i+1]);
    }
    auto check=[&](int x){
        ll ans=0;
        int mid=(n+1)/2;
        for(int i=1;i<=mid;i++){
            if(a[i]>x){
                int pur=ceil((a[i]+1)/(x+1));
                ans+=f[pur];
                if(ans>k) return 0;
            }
        }
        return 1;
    };
    sort(a+1,a+1+n);
    int l=0,r=a[n/2+1];
    while(l<=r){
        int mid=l+r>>1;
        if(check(mid)){
            r=mid-1;
        }
        else l=mid+1;
    }
    cout<<l<<endl;
}
signed main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int __;
    __=1;
    cin>>__;
    while(__--)
    {
    solve();
    }
}