from bisect import bisect_left

N, M, K = map(int, input().split())
C = list(input().split())
A = [int(input()) for _ in range(N)]
op = C[0]
B = [int(C[i]) for i in range(1, M+1)]
B.append(float('inf'))
B.sort()

ans = 0
for i in range(N):
    if op == '+':
        x = max(0, K-A[i])
    else:
        x = (K+A[i]-1) // A[i]
    ans += M - bisect_left(B, x)
print(ans)