MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from bisect import bisect_left,bisect_right

def main():
    n,m,k = map(int,input().split())
    li = input().split()
    op = li[0]
    b = [int(li[i]) for i in range(1,len(li))]
    a = [int(input()) for i in range(n)]
    a.sort()

    if op == '+':
        cnt = 0
        for i in range(m):
            cnt += n - bisect_left(a,k - b[i])
        print(cnt)
    
    elif op ==  '*':
        cnt = 0
        for i in range(m):
            cnt += n - bisect_left(a,-(-k//b[i]))
        print(cnt)

if __name__ =='__main__':
    main()