#include <bits/stdc++.h>
using ll=long long;
const long long INF=1LL<<60;
ll h,w;
long long power(long long a, long long n, ll m) {
    long long res = 1;
    while (n > 0) {
        if (n%2==1){
          res = res * a % m;
          n-=1;
        }
        a = a * a % m;
        n/=2;
    }
    return res;
}
int main(){
    ll n,p,q;
    std::cin >> n >> p >> q;
    std::vector<ll>A(n);
    for(auto&a:A)std::cin >> a;
    ll ans=0;
    std::vector<std::vector<std::vector<ll>>>dp(n+1,std::vector<std::vector<ll>>(p,std::vector<ll>(5)));
    dp[0][0][0]=1;
    for(int i=0;i<n;++i){
        for(int rem=0;rem<p;++rem){
            for(int cnt=0;cnt<5;++cnt){
                if(cnt!=4){
                    ll add=0;
                    if(cnt==0)add+=power(10, A[i], p);
                    else if(cnt==1)add+=power(9, A[i], p);
                    else if(cnt==2)add+=power(7, A[i], p);
                    else add+=power(5, A[i], p);
                    ll nrem=rem+add;nrem%=p;
                    dp[i+1][nrem][cnt+1]+=dp[i][rem][cnt];
                }
                dp[i+1][rem][cnt]+=dp[i][rem][cnt];
            }
        }
    }
    std::cout << dp.back()[q].back() << '\n';
}