import numpy as np
N, M, K = list(map(int, input().split()))
op, *B_list = input().split()
B_array = np.array(list(map(int, B_list)))
B_array.sort()

if op == "+":
    count = 0
    A_array = np.sort(np.array([int(input()) for i in range(N)]))[::-1]
    start = 0
    m = 0
    loop = True
    while loop:
        for n in range(start, N+1):
            if n == N or m == M:
                count += (n-start)*(M-m)
                loop = False
                break
            if B_array[m]+A_array[n] < K:
                if start == n:
                    m += 1
                    break
                else:
                    count += (n-start)*(M-m)
                    start = n
                    m += 1
                    break
    print(count)
else:
    count = 0
    A_array = np.sort(np.array([int(input()) for i in range(N)]))[::-1]
    start = 0
    m = 0
    loop = True
    while loop:
        for n in range(start, N+1):
            if n == N or m == M:
                count += (n-start)*(M-m)
                loop = False
                break
            if B_array[m]*A_array[n] < K:
                if start == n:
                    m += 1
                    break
                else:
                    count += (n-start)*(M-m)
                    start = n
                    m += 1
                    break

    print(count)