import bisect
n, m, k = map(int, input().split())
a = input().split()
op = a[0]
a = list(map(int, a[1:]))
b = [int(input()) for _ in range(n)]
b.sort(reverse = True)

if op == "+":
    for i in range(n):
        b[i] = k-b[i]
else:
    for i in range(n):
        b[i] = k/b[i]

ans = 0
for i in range(m):
    bi = bisect.bisect_right(b, a[i])
    ans += bi
print(ans)