from bisect import bisect_left

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

B.sort()
# L = [K - a for a in A] if op == '+' else [(K + a - 1) // a for a in A]
# ans = N * M - sum(bisect_left(B, l) for l in L)

if op == '+':
    ans = N * M - sum(bisect_left(B, K - a) for a in A)
else:
    ans = N * M - sum(bisect_left(B, (K + a - 1) // a) for a in A)

print(ans)