import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int q = Integer.parseInt(br.readLine());
		PrintWriter pw = new PrintWriter(System.out);
		for (int z = 0; z < q; z++) {
			String[] sa = br.readLine().split(" ");
			int n = Integer.parseInt(sa[0]);
			int m = Integer.parseInt(sa[1]);
			int k = Integer.parseInt(sa[2]);
			long p = Long.parseLong(sa[3]);
			int[] t = na(br, n);
			int[] c = na(br, n);
			int[] b = na(br, m);
			int[] d = na(br, m);
			int[] s = na(br, k);

			List<List<Obj>> list = new ArrayList<>(k + 1);
			for (int i = 0; i <= k; i++) {
				list.add(new ArrayList<>());
			}
			List<Obj> all = new ArrayList<>(m);
			for (int i = 0; i < m; i++) {
				Obj o = new Obj();
				o.i = i;
				o.b = b[i];
				o.d = d[i];
				list.get(o.d).add(o);
				all.add(o);
			}
			for (int i = 1; i <= k; i++) {
				Collections.sort(list.get(i), (o1, o2) -> o1.b - o2.b);
			}
			Collections.sort(all, (o1, o2) -> o1.b - o2.b);

			long ok = 2000000001;
			long ng = 0;
			while (Math.abs(ok - ng) > 1) {
				long mid = (ok + ng) / 2;
				long val = 0;
				for (int i = 0; i < n; i++) {
					int v0 = binarySearch(all, mid - t[i]);
					int v1 = binarySearch(list.get(c[i]), mid - t[i]);
					int v2 = binarySearch(list.get(c[i]), mid - t[i] + s[c[i] - 1]);
					val += v0 - v1 + v2;
				}
				if (val >= p) {
					ok = mid;
				} else {
					ng = mid;
				}
			}
//			System.out.println(ng);
			for (int i = 0; i < n; i++) {
				int idx = binarySearch(all, ng - t[i]);
				if (idx < m) {
					Obj o = all.get(idx);
					if (t[i] + o.b == ng) {
						pw.println((i + 1) + " " + (o.i + 1));
						break;
					}
				}
				idx = binarySearch(list.get(c[i]), ng - t[i] + s[c[i] - 1]);
				if (idx < list.get(c[i]).size()) {
					Obj o = list.get(c[i]).get(idx);
					if (t[i] + o.b - s[c[i] - 1] == ng) {
						pw.println((i + 1) + " " + (o.i + 1));
						break;
					}
				}
			}
		}
		pw.flush();
		br.close();
	}

	static int binarySearch(List<Obj> list, long val) {
		int ok = list.size();
		int ng = -1;
		while (Math.abs(ok - ng) > 1) {
			int mid = (ok + ng) / 2;
			if (list.get(mid).b >= val) {
				ok = mid;
			} else {
				ng = mid;
			}
		}
		return ok;
	}

	static class Obj {
		int i, b, d;
	}

	static int[] na(BufferedReader br, int n) throws Exception {
		String[] sa = br.readLine().split(" ");
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = Integer.parseInt(sa[i]);
		}
		return a;
	}
}