import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write #import pypyjit #pypyjit.set_param('max_unroll_recursion=-1') #sys.set_int_max_str_digits(10**9) 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: for ab in minus0: cnt+=len(plus1)-bisect.bisect_left(plus1,(-ans)//ab+1) for ab in plus0: cnt+=len(plus0)-bisect.bisect_left(minus1,(-ans)//ab+1) 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 for ab in minus0: cnt+=bisect.bisect_right(minus1,(ans-1)//ab) for ab in plus0: cnt+=bisect.bisect_right(plus1,(ans-1)//ab) return cnt