#include<bits/stdc++.h>
using namespace std;
constexpr int M=1e6+5;
int n,m,k,a[M],b[M],c[M];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
bool check(int mid){
    for (int i=1;i<=n;i++) c[i]=(a[i]+mid+1)/(mid+1);
    sort(c+1,c+n+1);long long sum=0;
    for (int i=1;i<=n+1>>1;i++) sum+=b[c[i]];
    return sum<=k;
}
void solve(){
    n=read();m=read();k=read();
    for (int i=1;i<=n;i++) a[i]=read();
    for (int i=1;i<=m;i++) b[i]=read();
    b[1]=0;
    for (int i=1;i<=m;i++)
        for (int j=i;j<=m;j+=i)
            b[j]=min(b[j],b[i]+b[j/i]);
    for (int i=m;i;i--) b[i-1]=min(b[i-1],b[i]);
    int l=0,r=m,ans=0;
    while (l<=r){
        int mid=l+r>>1;
        if (check(mid)) ans=mid,r=mid-1;
        else l=mid+1;
    }
    printf("%d\n",ans);
}
int main(){int T=read();while (T--) solve();return 0;}