import sys readline=sys.stdin.readline import bisect def Bisect_Int(ok,ng,is_ok): while abs(ok-ng)>1: mid=(ok+ng)//2 if is_ok(mid): ok=mid else: ng=mid return ok K,L,M,N,S=map(int,readline().split()) A=list(map(int,readline().split())) B=list(map(int,readline().split())) C=list(map(int,readline().split())) D=list(map(int,readline().split())) plus0,minus0,zero0=[],[],0 for a in A: for b in B: if a*b>0: plus0.append(a*b) elif a*b<0: minus0.append(-a*b) else: zero0+=1 plus1,minus1,zero1=[],[],0 for c in C: for d in D: if c*d>0: plus1.append(c*d) elif c*d<0: minus1.append(-c*d) else: zero1+=1 minus0.sort() minus1.sort() plus0.sort() plus1.sort() def is_ok(ans): cnt=0 if ans<0: i=len(plus1) for ab in minus0: while i and plus1[i-1]*ab>-ans: i-=1 cnt+=len(plus1)-i i=len(plus0) for ab in plus0: while i and minus1[i-1]*ab>-ans: i-=1 cnt+=len(minus1)-i elif ans==0: cnt+=len(plus0)*len(minus1) cnt+=len(plus1)*len(minus0) else: cnt+=len(plus0)*len(minus1) cnt+=len(plus1)*len(minus0) cnt+=zero0*(len(plus1)+len(minus1))+zero1*(len(plus0)+len(minus0))+zero0*zero1 i=0 for ab in minus0: while i