N, M, K = map(int, input().split())
bs = []
fs = []
for i in range(N+1):
    if i == 0:
        X = input().split()
        e = X[0] == '+'
        bs = list(map(int, X[1:]))
        bs.sort()
        continue
    x = int(input())
    fs.append(x)
fs.sort()
if e:
    j = N-1
    r = 0
    for b in bs:
        k = K-b
#        print(j)
        while j >= 0:
#            print(j, fs[j], k)
            if fs[j] < k:
                break
            j -= 1
#        print(k, fs, N-(j+1))
        r += N-j-1
    print(r)
else:
    j = N-1
    r = 0
    for b in bs:
        k = -(-K//b)
        while j >= 0:
            if fs[j] < k:
                break
            j -= 1
        r += N-j-1
    print(r)