#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

using ll = long long;

ll mod_pow(ll n, ll k, ll m) {
    ll res = 1;
    while (k > 0) {
        if (k & 1) {
            res = res * n % m;
        }
        n = n * n % m;
        k >>= 1;
    }
    return res;
}

int main() {
    ll N, P, Q;
    cin >> N >> P >> Q;
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    sort(A.begin(), A.end());

    map<ll, vector<ll>> mp;

    for (auto a: A) {
        ll r = mod_pow(5, a, P);
        mp[r].push_back(a);
    }
    for (auto& [k, v]: mp) {
        sort(v.begin(), v.end());
    }

    ll ans = 0;
    for (ll i = 0; i < N; i++) {
        for (ll j = i + 1; j < N; j++) {
            for (ll k = j + 1; k < N; k++) {
                ll s = (mod_pow(10, A[i], P) +
                        mod_pow(9, A[j], P) +
                        mod_pow(7, A[k], P)) % P;
                ll t = (Q - s + P) % P;
                if (mp.find(t) == mp.end()) {
                    continue;
                }
                auto& v = mp[t];
                auto it = lower_bound(v.begin(), v.end(), A[k] + 1);
                ans += v.end() - it;
            }
        }
    }
    cout << ans << endl;

    return 0;
}