from bisect import * N, M, K = map(int, input().split()) b = input().split() op = b[0] B = [int(b[i]) for i in range(1, M + 1)] B.sort() A = [int(input()) for _ in range(N)] ans = 0 if op == "+": for i in range(N): ans += len(B) - bisect_left(B, K - A[i]) else: for i in range(N): ans += len(B) - bisect_left(B, (K + A[i] - 1) // A[i]) print(ans)