#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template <class T = ll>
using vc = vector<T>;
template <class T = ll>
using vvc = vc<vc<T>>;
void solve();
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    ll t = 1;
    // cin >> t;
    for (int i = 1; i <= t; i++) solve();
    return 0;
}
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
ll dy[4] = {0, 1, 0, -1}, dx[4] = {1, 0, -1, 0};
void solve() {
    ll n, p, q;
    cin >> n >> p >> q;
    vc<ll> a(n);
    rep(i, 0, n) cin >> a[i];
    sort(a.begin(), a.end());
    const ll N = 2e6;
    vc<ll> pow10(N + 1), pow9(N + 1), pow7(N + 1), pow5(N + 1);
    pow10[0] = 1, pow9[0] = 1, pow7[0] = 1, pow5[0] = 1;
    rep(i, 1, N + 1) {
        pow10[i] = pow10[i - 1] * 10 % p;
        pow9[i] = pow9[i - 1] * 9 % p;
        pow7[i] = pow7[i - 1] * 7 % p;
        pow5[i] = pow5[i - 1] * 5 % p;
    }
    ll res = 0;
    rep(i, 0, n) rep(j, i + 1, n) rep(k, j + 1, n) rep(l, k + 1, n) {
        ll num = pow10[a[i]] + pow9[a[j]] + pow7[a[k]] + pow5[a[l]];
        if (num % p == q) res++;
    }
    cout << res << endl;
}