# yukiko No.988
from bisect import bisect_right,bisect_left
n,m,k=map(int,input().split())
b=list(map(str,input().split()))
c=b.pop(0)
a=[int(input()) for i in range(n)]
d=[]
for bb in b:
    d.append(int(bb))
d.sort()
ans=0
for i in range(n):
    if c=='+':
        ans+=bisect_left(d,k-a[i])
    else:
        ans+=bisect_left(d,k/a[i])
print(n*m-ans)