import bisect

n, m, k = map(int, input().split())
line = input().split()
op = line[0]
B = list(map(int, line[1:]))
A = [int(input()) for _ in range(n)]
A.sort()
B.sort()

f = (lambda a,b: a+b) if op == '+' else (lambda a,b: a*b)
ans = 0
for i in range(n):
    a = A[i]
    C = [f(a,b) for b in B]
    x = bisect.bisect_left(C, k)
    ans += m-x
print(ans)