#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int n, m, k;
    ll p;
    cin >> n >> m >> k >> p;
    p--;
    VL t(n), c(n), b(m), d(m), s(k);
    rep(i, n) cin >> t[i];
    rep(i, n) cin >> c[i], c[i]--;
    rep(i, m) cin >> b[i];
    rep(i, m) cin >> d[i], d[i]--;
    rep(i, k) cin >> s[i];
    VL tall = t, ball = b;
    sort(all(tall));
    sort(all(ball));
    VVL tc(k), bc(k);
    rep(i, n) tc[c[i]].emplace_back(t[i]);
    rep(i, m) bc[d[i]].emplace_back(b[i]);
    auto get_cnt = [](const VL& a, const VL& b, ll v) -> ll {
      int n = a.size(), m = b.size();
      int j = m;
      ll res = 0;
      for (ll x : a) {
        while (j && x + b[j-1] >= v) j--;
        res += j;
      }
      return res;
    };
    ll l = 0, r = 2001001001;
    while (r - l > 1) {
      ll c = (l + r) / 2;
      ll cnt = 0;
      cnt += get_cnt(tall, ball, c);
      rep(i, k) {
        cnt -= get_cnt(tc[i], bc[i], c);
        cnt += get_cnt(tc[i], bc[i], c + s[i]);
      }
      (cnt <= p ? l : r) = c;
    }
    VVI c2i(k), d2j(k);
    rep(i, n) c2i[c[i]].emplace_back(i);
    rep(j, m) d2j[d[j]].emplace_back(j);
    multiset<pair<ll, int>> st0, st1;
    rep(i, n) st0.emplace(t[i], i);
    int ans_i = -1, ans_j = -1;
    rep(col, k) {
      st1.clear();
      for (int i : c2i[col]) {
        st0.erase({t[i], i});
        st1.emplace(t[i], i);
      }
      for (int j : d2j[col]) {
        auto it = st0.lower_bound({l - b[j], -1});
        if (it != st0.end() && it->first == l - b[j]) {
          ans_i = it->second, ans_j = j;
          break;
        }
        it = st1.lower_bound({l - b[j] + s[col], -1});
        if (it != st1.end() && it->first == l - b[j] + s[col]) {
          ans_i = it->second, ans_j = j;
          break;
        }
      }
      if (ans_i != -1) break;
      for (int i : c2i[col]) st0.emplace(t[i], i);
    }
    assert(ans_i != -1);
    cout << ans_i + 1 << ' ' << ans_j + 1 << '\n';
  }
}