from bisect import bisect_left
n,m,k = map(int,input().split())
L = list(input().split())
op = L[0]
B = [int(b) for b in L[1:]]
B.sort()
A = [int(input()) for i in range(n)]
ans = 0
for a in A:
    if op == "+":
        ans += m-bisect_left(B,k-a)
    else:
        ans += m-bisect_left(B,(k+a-1)//a)
print(ans)