from collections import Counter

N, P, C = map(int, input().split())
A = list(map(int, input().split()))

if C == 0:
    ans = 0
    last = -1
    for i in range(N):
        if A[i] % P == 0:
            ans += i+1
            last = i
        elif last != -1:
            ans += last +1

    print(ans)
    exit()



cnt = Counter()
cnt[1] = 1

cur = 1
ans = 0
for i in range(N):
    if A[i] % P == 0:
        cnt = Counter()
        cnt[1] = 1
        continue

    nxt = cur * A[i] % P
    c = nxt * pow(C,-1,P) % P
    ans += cnt[c]
    cur = nxt
    cnt[cur] += 1

print(ans)