n,m,k=map(int,input().split())
l=list(input().split())
f=l[0]
l=[int(j)for j in l[1:]]
ll=[int(input())for j in range(n)]
ll.sort()
ans=0
import bisect
if f=="+":
    for i in l:
        ans+=n-bisect.bisect_left(ll,k-i)
else:
    for i in l:
        ans+=n-bisect.bisect_left(ll,-(-k//i))
print(ans)