#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=l; i<=r; i++)
#define per(i,l,r) for(int i=l; i>=r; i--)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int N=1e6+6;
int n,m,dp[N],a[N],K;
int suf[N];
void Min(int &x,int y){x=min(x,y);}
int cl(int x,int y){
    if(y==0)return x+1;
    return (x-1)/y+1;
}
bool ck(int ans){
    ll sum=0;
    per(i,n,1){
        if(a[i]<=ans)break;
        sum+=dp[cl(a[i],ans)];
    }
    return sum<=K;
}
void slv(){
    cin>>n>>m>>K;
    rep(i,1,n)cin>>a[i];
    sort(a+1,a+n+1); n=(n+1)/2;
    rep(i,1,m)cin>>dp[i];
    rep(i,2,m){
        for(int j=i*2;j<=m;j+=i)Min(dp[j],dp[i]+dp[j/i]);
    }
    suf[m]=dp[m];
    per(i,m-1,1)suf[i]=min(suf[i+1],dp[i]);
    auto &m1=dp[m+1]; m1=2e9+7;
    rep(i,2,m)Min(m1,dp[i]+suf[cl(m+1,i)]);
    per(i,m,1)Min(dp[i],dp[i+1]);
    // rep(i,1,m+1)cout<<dp[i]<<' '; cout<<'\n';
    int L=0,R=a[n],mid;
    while(L<=R){
        mid=L+R>>1;
        if(ck(mid))R=mid-1;
        else L=mid+1;
    }
    cout<<L<<'\n';
}
int main() {
    IOS
    int T;cin>>T;
    while(T--)slv();
    return 0;
}
/*
5 3 4
1 2 3 3 3
2 1 3 

3
3 5 0
2 5 2
3 2 4 6 13
3 5 3
2 5 3
3 2 4 6 13
3 5 6
2 5 2
3 2 4 6 13
*/