#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;

long long pow_mod(long long x, long long n, long long mod) {
    long long ret = 1;
    while (n > 0) {
        if (n & 1) {
            ret *= x;
            ret %= mod;
        }
        x *= x;
        x %= mod;
        n >>= 1;
    }
    return ret;
}

int main() {
    int n, p, q;
    cin >> n >> p >> q;
    assert(4 <= n && n <= 200);
    assert(2 <= q && q < p && p <= 100000);
    vector<int> a(n);
    for (int i = 0; i < n; ++i) { cin >> a[i]; }
    for (int i = 0; i < n; ++i) { assert(1 <= a[i] && a[i] <= 2000000); }
    sort(a.begin(), a.end());

    int ans = 0;
    for (int i = 0; i < n; ++i) {
        long long m10 = pow_mod(10, a[i], p);
        for (int j = i + 1; j < n; ++j) {
            long long m9 = pow_mod(9, a[j], p);
            for (int k = j + 1; k < n; ++k) {
                long long m7 = pow_mod(7, a[k], p);
                for (int l = k + 1; l < n; ++l) {
                    long long m5 = pow_mod(5, a[l], p);
                    long long sum = m10 + m9 + m7 + m5;
                    if (sum % p == q) {
                        ans += 1;
                    }
                }
            }
        }
    }
    cout << ans << endl;
    return 0;
}