#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> PP;
// #define MOD 1000000007
#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;i<=(n);++i)
#define RREP(i,n) for(ll i=(n)-1;i>=0;--i)
#define ORREP(i,n) for(ll i=(n);i>=1;--i)
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define GOODBYE do { cout << "-1" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl
#define debug true
#define debug2 false

long long power(long long b,long long e,long long mod=LLONG_MAX){
    // Copyright (c) 2023 0214sh7
    // https://github.com/0214sh7/library/
    long long r=1;
    while(e){
        if(e&1){
            r=(r*b)%mod;
        }
        b=(b*b)%mod;
        e >>=1;
    }
    return r;
}

int main(void){
    //cin.tie(nullptr);
    //ios::sync_with_stdio(false);
    
    ll N,P,Q;
    cin >> N >> P >> Q;
    vector<ll> A(N);
    REP(i,N){
        cin >> A[i];
    }
    
    sort(ALL(A));

    // dp[i][j][k] := iまで見た、j個取った、mod Pがk
    ll dp[2][5][100100] = {};
    dp[0][0][0] = 1;

    REP(i,N){

        vector<ll> pows(4,1);
        pows[0] = power(10,A[i],P);
        pows[1] = power(9,A[i],P);
        pows[2] = power(7,A[i],P);
        pows[3] = power(5,A[i],P);

        REP(j,5){
            REP(k,P){

                // 取らない
                dp[1][j][k] += dp[0][j][k];

                // 取る
                if(j!=4){
                    dp[1][j+1][(k + pows[j])%P] += dp[0][j][k];
                }

            }
        }
        
        swap(dp[0],dp[1]);
        REP(j,5){REP(k,100100){dp[1][j][k]=0;}}
    }

    ll Ans = dp[0][4][Q];
    cout << Ans << endl;
    
    return 0;
    
}