# ARC037C - 億マス計算に近いけどそれよりも簡単
# B昇順ソートして、bisectで何個満たすか数えればいい

N, M, K = map(int, input().split())
op_B = list(map(str, input().split()))
op = op_B[0]
B = [int(b) for b in op_B[1:]]
B.sort()

count = 0
from bisect import *
for i in range(N):
    a = int(input())
    if op == '+':
        idx = bisect_left(B, K-a)
        count += M - idx
    elif op == '*':
        idx = bisect_left(B, K/a)
        count += M - idx        
print(count)