def main():
    n, mod, c = list(map(int, input().split()))
    A = list(map(int, input().split()))
    if c == 0:
        p = 0
        ans = 0
        for a in A:
            if a == 0:
                ans += p * (p+1) // 2
                p = 0
            else:
                p += 1
        ans += p * (p+1) // 2
        ans = n * (n+1) // 2 - ans
        return ans
    else:
        c_ = pow(c, -1, mod)
        D = {1: 1}
        now = 1
        ans = 0
        for a in A:
            now = now * a % mod
            if now == 0:
                now = 1
                D = {1: 1}
            else:
                nxt = now * c_ % mod
                if nxt in D:
                    ans += D[nxt]
                if now in D:
                    D[now] += 1
                else:
                    D[now] = 1
        return ans

print(main())