#include <bits/stdc++.h>
#define ll long long
#define Ma 1000005
#define mod 998244353
#define N 1005
#define pb push_back

using namespace std;
ll inf=1e18;
ll a[Ma],c[Ma];
ll n,m,k;

vector <ll> v[Ma];

bool ask(ll x)
{
    ll cnt=0;
    for (ll i=1;i<=(n+1)/2;i++)
    {
        if (a[i]>x)
            cnt+=c[a[i]/(x+1)+1];
    }
    return (cnt<=k);
}

void sol()
{
    cin>>n>>m>>k;
    for (ll i=1;i<=n;i++)
        cin>>a[i];
    sort(a+1,a+n+1);
    for (ll i=1;i<=m;i++)
        cin>>c[i];
    c[m+1]=inf;
    for (ll i=m-1;i>=1;i--)
        c[i]=min(c[i],c[i+1]);
    for (ll i=1;i<=m;i++)
        for (auto z:v[i])
            c[i]=min(c[i],c[z]+c[i/z]);
    for (ll i=m-1;i>=1;i--)
        c[i]=min(c[i],c[i+1]);
    for (ll i=1;i<=m;i++)
        c[m+1]=min(c[m+1],c[i]+c[m/i+1]);
    ll l=0,r=m;
    while (l<=r)
    {
        ll mid=(l+r)>>1;
        if (ask(mid))
            r=mid-1;
        else
            l=mid+1;
    }
    printf("%lld\n",l);
}

int main()
{
    for (ll i=1;i<Ma;i++)
        for (ll j=i*2;j<Ma;j+=i)
            v[j].pb(i);
    ios::sync_with_stdio(0); cin.tie(0);
    ll tt=1;
    cin>>tt;
    while (tt--)
        sol();
    return 0;
}