#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(x) x.begin(), x.end()
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<ll,ll>;
#include <atcoder/all>
using namespace atcoder;
//using mint=static_modint<998244353>;
using mint=static_modint<1000000007>;

ll mod;

ll pow_mod(ll n,ll k){
    if(k==0)return 1;
    if(k%2==1)return pow_mod(n,k-1)*n%mod;
    if(k%2==0){
        ll t=pow_mod(n,k/2);
        return t*t%mod;
    }
}

int main(){
	ll n,p,q;cin>>n>>p>>q;
    mod=p;
    vector<ll> a(n);
    rep(i,n)cin>>a[i];
    sort(all(a));


    ll dp[n+1][5][p];
    rep(i,n+1)rep(j,5)rep(k,p)dp[i][j][k]=0;
    dp[0][0][0]=1;

    rep(i,n){
        rep(j,5){
            if(j==4)continue;
            rep(k,p){
                dp[i+1][j][k]+=dp[i][j][k];
                if(j==0)dp[i+1][j+1][(k+pow_mod(10,a[i]))%p]+=dp[i][j][k];
                if(j==1)dp[i+1][j+1][(k+pow_mod(9,a[i]))%p]+=dp[i][j][k];
                if(j==2)dp[i+1][j+1][(k+pow_mod(7,a[i]))%p]+=dp[i][j][k];
                if(j==3)dp[i+1][j+1][(k+pow_mod(5,a[i]))%p]+=dp[i][j][k];
            }
        }
    }

    cout<<dp[n][4][q]<<endl;
}