from math import gcd
from collections import Counter
import bisect
from operator import add, mul
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

if op == "+":
    A = [a % k for a in A]
    B = [b % k for b in B]
    ca = Counter(A)
    cb = Counter(B)

    ans = ca[0] * cb[0]
    for key, val in ca.items():
        ans += val * cb[k - key]
    print(ans)
else:
    A = [gcd(a, k) for a in A]
    B = [gcd(b, k) for b in B]
    ca = Counter(A)
    cb = Counter(B)

    ans = 0
    for ka, va in ca.items():
        for kb, vb in cb.items():
            if kb % (k // ka) == 0:
                ans += va * vb
    print(ans)