N,M,K=map(int,input().split())
F,*pB=input().split()
pb=[int(s)%K for s in pB]
sm=0
if F=='+':
    pa=[(int(input())+K-1)%K+1 for _ in range(N)]
    for n in pa:
        sm += pb.count(K-n)
else:
    for _ in range(N):
        n=int(input())%K
        for m in pb:
            sm += n*m%K==0
print(sm)