#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}



void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll N, M, K, P;
    cin >> N >> M >> K >> P;
    vector<pair<ll, int>> A(N), B(M);
    vector<vector<ll>> G(K), H(K);
    vector<ll> sa(N), sb(M);
    rep(rp, 0, 2){
        rep(i, 0, N) cin >> A[i].first, sa[i] = A[i].first;
        rep(i, 0, N) cin >> A[i].second, A[i].second--, G[A[i].second].push_back(A[i].first);
        swap(N, M);
        swap(A, B);
        So(sa);
        swap(sa, sb);
        swap(G, H);
    }
    vector<ll> S(K);
    rep(i, 0, K) cin >> S[i];
    rep(i, 0, K) So(G[i]), So(H[i]);
    ll l = -1, r = INF;
    while (r - l > 1){
        ll m = (l + r) / 2;
        ll c = 0;
        {
            int tmp = 0;
            for (int i = M - 1; i >= 0; i--){
                while (tmp != N && sa[tmp] + sb[i] < m){
                    tmp++;
                }
                c += tmp;
            }
        }
        // cout << "# " << m << " " << c << endl;
        rep(i, 0, K){
            int tmp1 = 0, tmp2 = 0;
            for (int j = (int)H[i].size() - 1; j >= 0; j--){
                while (tmp1 != (int)G[i].size() && H[i][j] + G[i][tmp1] < m) tmp1++;
                while (tmp2 != (int)G[i].size() && H[i][j] + G[i][tmp2] < m + S[i]) tmp2++;
                c += tmp2 - tmp1;
            }
        }
        if (c < P) l = m;
        else r = m;
    }
    map<ll, pair<int, int>> m1, m2;
    rep(i, 0, N){
        if (!m1.count(A[i].first)){
            m1[A[i].first] = {A[i].second, i};
        }
        else if (!m2.count(A[i].first) && m1[A[i].first].first != A[i].second){
            m2[A[i].first] = {A[i].second, i};
        }
    }
    pair<int, int> ans = {-1, -1};
    rep(j, 0, M){
        rep(rp, 0, 2){
            swap(m1, m2);
            if (m1.count(l - B[j].first) && m1[l - B[j].first].first != B[j].second){
                ans = {m1[l - B[j].first].second, j};
            }
            ll d = l + S[B[j].second] - B[j].first;
            if (m1.count(d) && m1[d].first == B[j].second){
                ans = {m2[d].second, j};
            }
        }
    }
    cout << ans.first + 1 << " " << ans.second + 1 << "\n";
}