from collections import defaultdict
from math import gcd

def make_divisors(n):
    divisors = []  # 必要に応じてsetにしても良いかも
    i = 1
    while i ** 2 <= n:
        if n % i == 0:
            divisors.append(i)
            if i ** 2 != n:
                divisors.append(n // i)
        i += 1
    divisors.sort()
    return divisors

dic = defaultdict(int)
dic2 = defaultdict(int)
N, M, K = map(int, input().split())
if K == 1:
    print(N * M)
    exit()
op, *B = input().split()
A = []
for i in range(N):
    A.append(int(input()))
B = [int(i) for i in B]
ans = 0
if op == "+":
    for b in B:
        dic[(-b) % K] += 1
    for a in A:
        if a % K in dic:
            ans += dic[a % K]
else:
    D = make_divisors(K)
    for b in B:
        x = gcd(b, K)
        dic[x] += 1
    for a in A:
        x = gcd(a, K)
        dic2[x] += 1
    for d1 in D:
        for d2 in D:
            if gcd(d1 * d2, K) == K:
                ans += dic[d1] * dic2[d2]
print(ans)