H,W,K=map(int,input().split())

B=list(input().split())
OP=B[0]
B=B[1:]
#print(B)
for i in range(len(B)):
    B[i]=int(B[i])
B.sort()
B=B+[10**10]
#print(B)

import bisect

ans=0
if OP=="+":
    for i in range(H):
        A=int(input())
        x=bisect.bisect_left(B,K-0.1-A)
        ans+=(W-x)
    print(ans)
else:
    for i in range(H):
        A=int(input())
        x=bisect.bisect_left(B,K/A)
        ans+=(W-x)
    print(ans)