import bisect
N,M,K = map(int,input().split())
B = list(input().split())
OP = B[0]
B = list(map(int, B[1:]))
A = []
for _ in range(N):
    A.append(int(input()))
A.sort()
B.sort()
ANS = 0
if OP=='+':
    for a in A:
        ANS += M-bisect.bisect_left(B,K-a)
else:
    SB = sum(B)
    for a in A:
        ANS += M-bisect.bisect_left(B,K/a)
print(ANS)