#include <iostream>
#include <vector>
#include <algorithm>

std::vector<int> ints(int size) {
    std::vector<int> result(size);
    for (int& i : result) {
        std::cin >> i;
    }
    return result;
}

int main() {
    int N, P, Q;
    std::cin >> N >> P >> Q;
    std::vector<int> A = ints(N);
    std::sort(A.begin(), A.end());

    const int AMAX = 2000010;
    std::vector<int> n10(1, 1), n9(1, 1), n7(1, 1), n5(1, 1);

    int p = 1;
    for (int i = 0; i < AMAX; ++i) {
        p = (p * 10) % P;
        n10.push_back(p);
    }

    p = 1;
    for (int i = 0; i < AMAX; ++i) {
        p = (p * 9) % P;
        n9.push_back(p);
    }

    p = 1;
    for (int i = 0; i < AMAX; ++i) {
        p = (p * 7) % P;
        n7.push_back(p);
    }

    p = 1;
    for (int i = 0; i < AMAX; ++i) {
        p = (p * 5) % P;
        n5.push_back(p);
    }

    int cnt = 0;
    for (int a = 0; a < N; ++a) {
        for (int b = a + 1; b < N; ++b) {
            for (int c = b + 1; c < N; ++c) {
                for (int d = c + 1; d < N; ++d) {
                    if ((n10[A[a]] + n9[A[b]] + n7[A[c]] + n5[A[d]]) % P == Q) {
                        ++cnt;
                    }
                }
            }
        }
    }

    std::cout << cnt << std::endl;

    return 0;
}