#!/usr/bin/env python3
# %%
stdin = open(0)

# %%
import numpy as np

# %%
N, M, K = map(int, stdin.readline().split())
op = stdin.read(1)
BA = np.fromstring(stdin.read(), np.int64, sep=' ')

# %%
B = BA[:M]
A = BA[M:]

# %%
def solve_add(A, B):
    A %= K
    A.sort()
    target = (-B) % K
    cnt = np.searchsorted(A, target, 'right') - np.searchsorted(A, target, 'left')
    return cnt.sum()

# %%
def solve_mult(A, B):
    B_keys, B_nums = np.unique(np.gcd(B, K), return_counts=True)
    A_keys, A_nums = np.unique(np.gcd(A, K), return_counts=True)
    keys = np.multiply.outer(A_keys, B_keys)
    nums = np.multiply.outer(A_nums, B_nums)
    return ((keys % K == 0) * nums).sum()


# %%
answer = solve_add(A, B) if op == '+' else solve_mult(A, B)
print(answer)