#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll

const int N = 1e6+10,mo = 1e9+7;
template<class T>
struct BIT {
	T c[N];
	int size;
	void resize(int s) { 
        size = s;
        for(int i=0;i<=s;i++)c[i]=2e9;
    }
	T query(int x) { // 1 ... x
		assert(x <= size);//检测错误输入
		T s = 2e9;
		for (; x; x -= x & (-x)) {
			s =min(s,c[x]);
		}
		return s;
	}
	void modify(int x, T s) { // a[x] += s
		assert(x != 0);
		for (; x <= size; x += x & (-x)) {
			c[x] =min(c[x], s);
		}
	}
};
int a[N],dp[N];
BIT <int>tree;
void fuck(int n){
    tree.resize(n);
    for(int i=n-1;i>=1;i--)dp[i]=min(dp[i+1],dp[i]);
    for(int i=1;i<=n;i++){
        tree.modify(n-i+1,dp[i]);
    }
    for(int i=1;i<=n;i++){
        dp[i]=min(dp[i],tree.query(n-i+1));
        for(int j=2;j<=n;j++){
            if(i*j>n)break;;
            dp[i*j]=min(dp[i*j],dp[i]+dp[j]);
            tree.modify(n-i*j+1,dp[i*j]);
        }
    }
    // cerr<<"dp:";for(int i=1;i<=n;i++)cerr<<dp[i]<<" \n"[i==n];
}
int n,m,k;
bool check(int mid){
    ll sum=0;
    for(int i=1;i<=n/2+1;i++){
        if(a[i]>mid){
            int kk=a[i]/(mid+1)+1;
            if(kk>m)return 0;
            sum+=dp[kk];
        }
    }
    // cerr<<"sum="<<sum<<" k="<<k<<"\n";
    return sum<=k;
}
inline void solve(){
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=m;i++)cin>>dp[i];
    dp[m+1]=1e18;
    dp[m+2]=1e18;
    m+=2;
    fuck(m);
    a[n+1]=2e9;
    sort(a+1,a+1+n);
    int r=a[n/2+2];
    int l=0;
    while(l<r){
        int mid=l+r>>1;
        bool res=check(mid);
        // cerr<<"res="<<res<<"\n";
        if(res)r=mid;
        else l=mid+1;
    }
    cout<<l<<"\n";
}



signed main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int WTN666=1;cin>>WTN666;
    while(WTN666--){
        solve();
    }
}