import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict, Counter
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N, M, K = map(int, input().split())
op, *B = input().split()
B = list(map(int, B))

ans = 0
if op == '+':
    cnt = defaultdict(int)
    for b in B:
        cnt[b % K] += 1
    cnt[K] = cnt[0]

    for _ in range(N):
        a = int(input())
        ans += cnt[K - a % K]
else:
    cnt = {}

    for _ in range(N):
        a = int(input())
        g = K // math.gcd(a, K)
        if cnt.get(g) is None:
            acc = 0
            for b in B:
                if b % g == 0:
                    acc += 1
            cnt[g] = acc
        ans += cnt[g]
print(ans)