N,M,K=map(int,input().split())
F,*pB=input().split()
pb=sorted(int(s) for s in pB)

if F=='+' :fn=lambda x,y:x+y
else      :fn=lambda x,y:x*y

cn=0
for _ in range(N):
    A=int(input())
    ns=-1
    ne= M
    while ne-ns>1:
        n=(ns+ne)//2
        if fn(A,pb[n])<K:   ns=n
        else:               ne=n
    cn += M-ne

print(cn)