from bisect import bisect_left

N, M, K = map(int, input().split())
op, *B = input().split()
B = list(map(int, B))
A = [int(input()) for _ in range(N)]

B.sort()
A.sort()

res = 0

if op == '+':
    for i in range(N):
        res += M - bisect_left(B, K - A[i])
else:
    for i in range(N):
        res += M - bisect_left(B, -(-K // A[i]))

print(res)