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

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

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

    int ans = 0;
    for (int i = 0; i < N; ++i) {
        for (int j = i + 1; j < N; ++j) {
            for (int k = j + 1; k < N; ++k) {
                for (int l = k + 1; l < N; ++l) {
                    int tmp = pow(10, A[i]) + pow(9, A[j]) + pow(7, A[k]) + pow(5, A[l]);
                    if (tmp % P == Q) {
                        ans++;
                    }
                }
            }
        }
    }
    
    cout << ans << endl;

    return 0;
}