import sys
readline=sys.stdin.readline
from collections import defaultdict
from math import gcd as GCD

def Divisors(N):
    divisors=[]
    for i in range(1,N+1):
        if i**2>=N:
            break
        elif N%i==0:
            divisors.append(i)
    if i**2==N:
        divisors+=[i]+[N//i for i in divisors[::-1]]
    else:
        divisors+=[N//i for i in divisors[::-1]]
    return divisors

def Factorize(N):
    assert N>=1
    factors=defaultdict(int)
    for p in range(2,N):
        if p**2>N:
            break
        while N%p==0:
            factors[p]+=1
            N//=p
    if N!=1:
        factors[N]+=1
    return factors

N,M,K=map(int,readline().split())
op,*B=readline().split()
for m in range(M):
    B[m]=int(B[m])
A=[int(readline()) for n in range(N)]
if op=="+":
    cnt=defaultdict(int)
    for b in B:
        cnt[b%K]+=1
    ans=0
    for a in A:
        ans+=cnt[(-a)%K]
else:
    cnt=defaultdict(int)
    D=Divisors(K)
    F=Factorize(K)
    for b in B:
        g=GCD(b,K)
        cnt[g]+=1
    for p in F.keys():
        for d in D[::-1]:
            if d%p==0:
                cnt[d//p]+=cnt[d]
    ans=0
    for a in A:
        g=GCD(a,K)
        ans+=cnt[K//g]
print(ans)