import bisect
N,M,K = map(int, input().split())
B = [i for i in input().split()]
op = B.pop(0)
A = [int(input()) for _ in range(N)]
for i in range(M):
    B[i] = int(B[i])

def gcd(a, b):
    if a < b:
        a, b = b, a
    if a%b == 0:
        return b
    return gcd(b, a%b)

ans = 0
if op == "+":
    for i in range(N):
        A[i] %= K
    for j in range(M):
        B[j] %= K
    B.sort()
    for a in A:
        l = bisect.bisect_left(B, (K-a)%K)
        r = bisect.bisect_right(B, (K-a)%K)
        ans += r-l
    if K == 1:
        ans = N*M
else:
    dic = {}
    i = 1
    while i < K**0.5:
        if K%i == 0:
            dic[i] = 0
            dic[K//i] = 0
        i += 1
    if K%int(K**0.5) == 0:
        dic[int(K**0.5)] = 0
    for b in B:
        b = gcd(b, K)
        dic[b] += 1
    Key = sorted(dic)
    for i in range(len(Key)):
        for j in range(i+1, len(Key)):
            if Key[j]%Key[i] == 0:
                dic[Key[i]] += dic[Key[j]]
    for a in A:
        ans += dic[K//gcd(a, K)]

print(ans)