#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),i##z=(b);i<=i##z;i++)
#define ROF(i,a,b) for(int i=(a),i##z=(b);i>=i##z;i--)
#define REP(i,u) for(int i=hd[u],v;v=to[i],i;i=nxt[i])
#define temT template<typename T>
#define temT12 template<typename T1,typename T2>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
typedef long double ld;
const int N=int(1e6)+10,inf=int(1e9)+7;

int T,n,m,K; int a[N],f[N],g[N],mx;

void Min(int &x,int y){ x=min(x,y); }

priority_queue<pii> pq;

int calc(int cur,int last){
	if(cur==last) return 0;
	int low=(cur==0)?(last+1):((last+cur-1)/cur);
	return f[g[low]];
}
int get_low(int cur,int last){
	if(cur==last) return 0;
	int low=(cur==0)?(last+1):((last+cur-1)/cur);
	return g[low];
}

int main(){
	for(cin>>T;T--;){
		cin>>n>>m>>K;
		FOR(i,1,n) cin>>a[i];
		sort(a+1,a+n+1); mx=a[n/2+1]+1;
		FOR(i,1,mx) f[i]=inf;
		for(int i=1,t;i<=m;i++){
			cin>>t;
			if(i<mx) f[i]=t;
			else Min(f[mx],t);
		}
		FOR(i,1,mx){
			FOR(j,1,mx/i)
				Min(f[i*j],f[i]+f[j]);
			Min(f[mx],f[i]+f[(mx+i-1)/i]);
		}
		g[mx]=mx;
		ROF(i,mx-1,1) g[i]=(f[g[i]]<f[g[i+1]])?i:g[i+1];
		int ans=mx-1,final=mx; ll tot=0;
		FOR(i,1,n/2+1) pq.push(pii(a[i],a[i]));
		while(ans>=0){
			while(pq.top().first>ans){
				pii tmp=pq.top(); pq.pop();
				tot+=calc(ans,tmp.second)-calc(tmp.first,tmp.second);
				pq.push(pii(tmp.second/get_low(ans,tmp.second),tmp.second));
			}
			if(tot<=K) ans--,Min(final,pq.top().first);
			else break;
		}
		cout<<final<<"\n";
	}
	return 0;
}