#yuki989
import bisect
n,m,k=map(int,input().split())
op=input().split()
b=[]
for i in range(1,len(op)):
 b.append(int(op[i]))
b.sort()
a=[]
for i in range(n):
 a.append(int(input()))
res=n*m
for i in a:
 if op[0]=='+':
  res-=bisect.bisect_left(b,k-i)
 else:
  res-=bisect.bisect_left(b,k/i)
print(res)