from bisect import bisect_left
n, m, k = map(int, input().split())
op, *B = input().split()
B = [int(b) for b in B]
A = [int(input()) for _ in range(n)]

B.sort()

ans = 0

if op == "+":
  for a in A:
    t = k - a
    ans += m - bisect_left(B, t)
else:
  for a in A:
    t = (k - 1) // a + 1
    ans += m - bisect_left(B, t)
print(ans)