from bisect import bisect_left, bisect_right def kiriage(a, b): return (a+b-1)//b def cnt_miman(li, x): # x 未満の要素数 return bisect_left(li, x) def cnt_ijou(li, x): # x 以上の要素数 return len(li) - cnt_miman(li, x) N, M, K = map(int, input().split()) op, *B = input().split() A = [int(input()) for _ in range(N)] B = list(map(lambda x: int(x), B)) A.sort() B.sort() ans = 0 for a in A: if op == '+': partner = K - a else: partner = kiriage(K, a) # B の中に partner 以上の数字はいくつあるか? ans += cnt_ijou(B, partner) print(ans)