from bisect import bisect_left, bisect, insort_left, insort
from math import *
def solve():
    n, m, k = map(int, input().split())
    op, *B = input().split()
    B = sorted(map(int, B))
    A = list(int(input()) for _ in range(n))
    ans = 0
    for i in range(n):
        if op == "*":
            K = ceil(k / A[i])
        else:
            K = k - A[i]
        ans += m - bisect_left(B, K)
    print(ans)
solve()