import bisect

n, m, k = map(int, input().split())

row = []
r = list(input().split())
opt = r[0]

for i in r[1:]:
    row.append(int(i))
row.sort()

cnt = 0
for i in range(n):
    c = int(input())
    if opt == "+":
        idx = bisect.bisect_left(row, k - c)
        cnt += m - idx
    else:
        idx = bisect.bisect_left(row, k / c)
        cnt += m - idx

print(cnt)