R=range
J=lambda:list(map(int,input().split()))
def d(x,y,c):
	a,j=0,len(y)
	for t,i in x:
		while j and t+y[j-1][0]>c:j-=1
		a+=j
	return a
for _ in R(sum(J())):
	N,M,K,P=J();T=J();C=J();B=J();D=J();S=[0]+J();X,Y=[[[]for k in R(K+1)]for d in R(2)];Z,W=[],[]
	for i in R(N):Z+=[[T[i],i]];X[C[i]]+=[Z[i]];
	for j in R(M):W+=[[B[j],-j]];Y[D[j]]+=[W[j]];
	for k in R(K+1):X[k].sort();Y[k].sort();
	Z.sort();W.sort()
	l,c=-1,11**9
	while l+1<c:
		m=(l+c)>>1
		if d(Z,W,m)+sum(d(x,y,m+s)-d(x,y,m)for x,y,s in zip(X,Y,S))<P:l=m
		else:c=m
	a=0
	for x,y,s in zip(X,Y,S):
		j=len(y)
		for t,i in x:
			while j and t+y[j-1][0]>c+s:j-=1
			if j and t+y[j-1][0]==c+s:a=1+i,1-y[j-1][1]
	if a==0:
		j=len(W)
		for t,i in Z:
			while j and(t+W[j-1][0],C[i]==D[-W[j-1][1]])>(c,0):j-=1
			if j and t+W[j-1][0]==c:a=1+i,1-W[j-1][1]
	print(*a)