import math
from collections import Counter

def getprimes(x):
    res = []
    a = 2
    while x > a*a:
        while x % a == 0:
            res.append(a)
            x //= a
        a += 1
    if x != 1:
        res.append(x)
    return res

def getfactors(x):
    res = []
    for i in range(1, int(x**0.5)+1):
        if x % i == 0:
            res.append(i)
            if i != x // i:
                res.append(x//i)
    res.sort()
    return res

n, m, k = map(int, input().split())
line = input().split()
op = line[0]
B = list(map(int, line[1:]))
A = [int(input()) for _ in range(n)]

if op == '+':
    mod = [a % k for a in A]
    modcnt = Counter(mod)
    ans = sum([modcnt[(k - (b%k)) % k] for b in B])
else:
    factors = []
    for a in A:
        factors += getfactors(a)
    factorcnt = Counter(factors)
    ans = 0
    for a in A:
        l = k // math.gcd(a, k)
        ans += factorcnt[l]
print(ans)