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())) lst0=[] for a in A: for b in B: lst0.append(a*b) minus1,plus1,zero1=[],[],0 for c in C: for d in D: if c*d<0: minus1.append(c*d) elif c*d==0: zero1+=1 else: plus1.append(c*d) minus1.sort(reverse=True) plus1.sort(reverse=True) lst0.sort() def is_ok(ans): cnt=0 i=0 for cd in minus1: while i=ans: i+=1 cnt+=len(lst0)-i #cnt+=len(lst0)-Bisect_Int(0,len(lst0)+1,lambda i:i==0 or lst0[i-1]*cd>=ans) assert i==Bisect_Int(0,len(lst0)+1,lambda i:i==0 or lst0[i-1]*cd>=ans) if 0