n, m, k = map(int, input().split())
l = list(map(str, input().split()))
b = [int(l[i]) for i in range(1, m+1)]

op = l[0]
#print(op)
#rint(b)

a = [0]*n
for i in range(n):
    a[i] = int(input())

#print(a)
#print(b)
a.sort()
b.sort()
import bisect
import math
if op == '+':
    ans = 0
    for i in range(n):
        p = k -a[i]
        q = bisect.bisect_left(b, p)
        ans += m-q
else:
    ans = 0
    for i in range(n):
        p = math.ceil(k/a[i])
        q = bisect.bisect_left(b, p)
        ans += m-q
print(ans)