def gcd(a: int, b: int) -> int:
    """a, bの最大公約数(greatest common divisor: GCD)を求める
    計算量: O(log(min(a, b)))
    """
    if b == 0:
        return a
    return gcd(b, a%b)


def make_divisors(n):
    """自然数nの約数を列挙したリストを出力する
    計算量: O(sqrt(N))
    入出力例: 12 -> [1, 2, 3, 4, 6, 12]
    """
    divisors = []
    for k in range(1, int(n**0.5) + 1):
        if n % k == 0:
            divisors.append(k)
            if k != n // k:
                divisors.append(n // k)
    divisors = sorted(divisors)
    return divisors

n, m, k = list(map(int, input().split()))
op = list(input().split())
b = [int(op[i]) for i in range(1, m + 1)]
a = [int(input()) for i in range(n)]

ans = 0
if op[0] == "+":
    a = [a[i] % k for i in range(n)]
    b = [b[i] % k for i in range(m)]
    cnt_b = {}
    for num in b:
        if num not in cnt_b:
            cnt_b[num] = 1
        else:
            cnt_b[num] += 1
    for num in a:
        if num == 0:
            ans += cnt_b[num]
        if k - num in cnt_b:
            ans += cnt_b[k - num]
else:
    li = make_divisors(k)
    to_ind = {v: i for i, v in enumerate(li)}
    a_li = [0] * len(li)
    b_li = [0] * len(li)
    for num in a:
        tmp = gcd(num, k)
        a_li[to_ind[tmp]] += 1  
    for num in b:
        tmp = gcd(num, k)
        b_li[to_ind[tmp]] += 1 

    for i, num1 in enumerate(li):
        for j, num2 in enumerate(li):
            if (num1 * num2) % k == 0:
                ans += a_li[i] * b_li[j]

print(ans)