#include<bits/stdc++.h>
using namespace std;
int n , m;
typedef long long ll;
typedef pair<int,ll> pil;
pil a[200005] , b[200005];
pil g[400005];
ll s;

ll sum[400005] ;
ll f[400005];
ll chk(int l) {
    for(int i = 1;i <= n + m + 1;i++) f[i] = 2e18;
    f[1] = 0;
    int nxta = 1 , nxtb = 1;
    int la = 1 , lb = 1;
    for(int i = 1;i <= n + m;i++) {
        if(nxta == i) nxta++ ;
        if(nxtb == i) nxtb++ ;
        if(la == i) la++ ;
        if(lb == i) lb++ ;

        while(nxta <= n+m+1 && (g[nxta].second < 0)) nxta++ ;
        while(nxtb <= n+m+1 && (g[nxtb].second > 0)) nxtb++ ;
        while(la <= n+m+1 && (g[la].second < 0 || g[la].first - g[i].first < l)) la++ ;
        while(lb <= n+m+1 && (g[lb].second > 0 || g[lb].first - g[i].first < l)) lb++ ;
        // printf("%d %lld %d %d\n",i,f[i],nxta,la);
        if(g[i].second > 0) { /// a
            f[nxta] = min(f[nxta] , f[i] + sum[nxta - 1] - sum[i]); 
            f[lb] = min(f[lb] , f[i] + sum[lb - 1] - sum[i]) ;
        }
        else {
            f[nxtb] = min(f[nxtb] , f[i] + sum[nxtb - 1] - sum[i]);
            f[la] = min(f[la] , f[i] + sum[la - 1] - sum[i]) ;
        }
    }
    // cout << f[n + m + 1] << '\n';
    return f[n + m + 1];
}
void solv() {
    cin >> n >> m >> s;
    for(int i = 1;i <= n;i++) cin >> a[i].first;
    for(int i = 1;i <= m;i++) cin >> b[i].first;
    for(int i = 1;i <= n;i++) cin >> a[i].second;
    for(int i = 1;i <= m;i++) cin >> b[i].second;
    sort(a + 1 , a + n + 1);
    sort(b + 1 , b + m + 1);
    int l = 0 , r = 2e9;
    r = min(r , max(abs(a[1].first - b[m].first) , abs(a[n].first - b[1].first))) ;
    // cout << a[n].first <<' ' << b[1].first << '\n';

    for(int i = 1;i <= n;i++) g[i] = a[i];
    for(int i = 1;i <= m;i++) g[i + n] = b[i] , g[i].second *= -1;
    sort(g + 1 , g + n + m);
    for(int i = 1;i <= n + m ;i++) {
        sum[i] = sum[i - 1];
        sum[i] += abs(g[i].second) ;
    }
    // chk(1) ; return ;
    while(l < r) {
        int md = ((ll)l + r) / 2 + 1;
        if(chk(md) <= s) l = md;
        else r = md - 1;
    }
    cout << l << '\n';
    return ;
}
int main() {
    ios::sync_with_stdio(false) ; cin.tie(0) ;
    int t;cin >> t;
    while(t--) solv() ;
}