from bisect import bisect_left
N,M,K=map(int,input().split())
F,*pB=input().split()
pb=sorted(int(s) for s in pB)
pa=[int(input()) for _ in range(N)]
if F=='+':pz=[bisect_left(pb,K-A) for A in pa]
else 	:pz=[bisect_left(pb,(K+A-1)//A) for A in pa]
print(N*M-sum(pz))