#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
#define rep(i,n) for(int i=0; i<int(n); i++)
#define repr(i,n) for(int i=int(n)-1; i>=0; i--)
using namespace std;

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int N, P, Q; cin >> N >> P >> Q;
    using Modint = atcoder::modint;
    Modint::set_mod(P);
    vector<int> A(N); rep(i,N) cin >> A[i];
    sort(A.begin(), A.end());
    vector<vector<Modint>> X(4, vector<Modint>(N));
    rep(i,N) X[0][i] = Modint(10).pow(A[i]);
    rep(i,N) X[1][i] = Modint(9).pow(A[i]);
    rep(i,N) X[2][i] = Modint(7).pow(A[i]);
    rep(i,N) X[3][i] = Modint(5).pow(A[i]);
    int ans = 0;
    rep(i,N) rep(j,i) rep(k,j) rep(l,k){
        Modint t = X[3][i] + X[2][j] + X[1][k] + X[0][l];
        if(t.val() == Q) ans++;
    }
    cout << ans << '\n';
    return 0;
}