#include <bits/stdc++.h>
#include <atcoder/all>
using mint = atcoder::modint998244353;
// using mint = atcoder::modint1000000007;
using namespace atcoder;
using namespace std;

#define rep(i,n) for (int i = 0; i < n; i++)
using ll = long long;
set<char> abc = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
const int inf =1e9;
const ll infl = 4e18;
template <typename T>
bool chmax(T &a, const T& b) {if (a < b) {a = b;  return true;}return false;}
template <typename T>
bool chmin(T &a, const T& b) {if (a > b) {a = b;  return true;}return false;}

long long pow(long long x, long long n, long long mod) {
    assert(2 <= mod);
    assert(x>=0);
    assert(n>=-1);
    long long res = 1;
    if (n==-1){
        return pow(x, mod-2, mod);
    }
    while (n > 0) {
        if (n & 1) res = (res * x) % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return (res%mod+mod)%mod;
}

int main(){
    ll N,P,Q; cin >> N >> P >> Q;
    vector<ll> A(N); rep(i,N) cin >> A[i];
    sort(A.begin(),A.end());
    int ans=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 ((pow(10,A[a],P)+pow(9,A[b],P)+pow(7,A[c],P)+pow(5,A[d],P))%P==Q) ans++;
                }
            }
        }
    }
    cout << ans << endl;
}