import sys
from bisect import bisect_left

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    N, M, K = map(int, rl().split())
    op, *B = input().split()
    B = [int(bi) for bi in B]
    A = [int(rl()) for _ in range(N)]
    
    B.sort()
    ans = 0
    if op == '+':
        for ai in A:
            ans += M - bisect_left(B, K - ai)
    else:
        for ai in A:
            ans += M - bisect_left(B, -(-K // ai))
    print(ans)


if __name__ == '__main__':
    solve()