import bisect
n,m,k = map(int,input().split())
opb = input().split()
op = opb[0]
b = []
for i in range(1,m+1):
    b.append(int(opb[i]))

a = [int(input()) for i in range(n)]
a.sort()
b.sort()

ans = 0

for i in range(n):
    if op == "+":
        ans += m-bisect.bisect_left(b,k-a[i])
    else:
        ans += m-bisect.bisect_left(b,(k+a[i]-1)//a[i])
    #print(n,ans)

print(ans)