#include <bits/stdc++.h>
#define Fst first
#define Snd second
#define MP make_pair
#define ll long long
#define PII pair<int,int>
#define PIL pair<int,ll>
#define PLI pair<ll,int>
#define PLL pair<ll,ll>
#define PDD pair<double,double>
using namespace std;
int tac,n,m;
ll S,al;
pair<int,PIL> p[400010];
ll d[400010][2][2],mxa[2][2][2],mxb[2][2][2];
inline bool CHECK(int mid)
{
    for (int i=0;i<n;i++)
        for (int j=0;j<2;j++)
            for (int k=0;k<2;k++) d[i][j][k]=-2e18;
    for (int i=0;i<2;i++)
        for (int j=0;j<2;j++)
            for (int k=0;k<2;k++) mxa[i][j][k]=mxb[i][j][k]=-2e18;
    int it=0;
    for (int i=0;i<n;i++)
    {
        while (it<n && p[it].Fst<=p[i].Fst-mid)
        {
            for (int j=0;j<2;j++)
                for (int k=0;k<2;k++)
                    mxb[p[it].Snd.Fst][j][k]=max(mxb[p[it].Snd.Fst][j][k],d[it][j][k]);
            it++;
        }
        for (int j=0;j<2;j++)
        {
            for (int k=0;k<2;k++)
            {
                if (!j && !k) continue;
                if ((!p[i].Snd.Fst && !k) || (p[i].Snd.Fst && !j)) d[i][j][k]=max(d[i][j][k],0ll);
                d[i][j][k]=max(d[i][j][k],mxa[p[i].Snd.Fst][j][k]);
                for (int ji=0;ji<2;ji++)
                {
                    for (int ki=0;ki<2;ki++)
                    {
                        if ((ji|(p[i].Snd.Fst==0))!=j || (ki|(p[i].Snd.Fst==1))!=k) continue;
                        d[i][j][k]=max(d[i][j][k],mxb[p[i].Snd.Fst^1][ji][ki]);
                    }
                }
                d[i][j][k]+=p[i].Snd.Snd;
                mxa[p[i].Snd.Fst][j][k]=max(mxa[p[i].Snd.Fst][j][k],d[i][j][k]);
                //if (d[i][j][k]>0) cerr <<i<<" "<<j<<" "<<k<<" "<<d[i][j][k]<<" d\n";
            }
        }
    }
    ll res=-2e18; for (int i=0;i<n;i++) res=max(res,d[i][1][1]);
    return al-res<=S;
}
inline void Main()
{
    scanf("%d%d%lld",&n,&m,&S); al=0;
    for (int i=0;i<n;i++) scanf("%d",&p[i].Fst),p[i].Snd.Fst=0;
    for (int i=0;i<m;i++) scanf("%d",&p[i+n].Fst),p[i+n].Snd.Fst=1;
    for (int i=0;i<n;i++) scanf("%lld",&p[i].Snd.Snd),al+=p[i].Snd.Snd;
    for (int i=0;i<m;i++) scanf("%lld",&p[i+n].Snd.Snd),al+=p[i+n].Snd.Snd;
    n+=m; sort(p,p+n); ll l=0,r=2e9+7;
    //for (int i=0;i<n;i++) cerr <<p[i].Fst<<" "<<p[i].Snd.Fst<<" "<<p[i].Snd.Snd<<" p\n";
    while (l<r)
    {
        ll mid=(l+r+1)>>1;
        //cerr <<l<<" "<<r<<" "<<mid<<" -----------------------\n";
        if (CHECK(mid)) l=mid;
        else r=mid-1;
    }
    printf("%lld\n",l);
}
int main()
{
    scanf("%d",&tac);
    while (tac--) Main();
    return 0;
}