#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; std::sort(A.begin(),A.end()); std::vector<ll>ten(n),nine(n),seven(n),five(n); for(int i=0;i<n;++i){ ten[i]=power(10, A[i], p); nine[i]=power(9, A[i], p); seven[i]=power(7, A[i], p); five[i]=power(5, A[i], p); } ll ans=0; std::vector<std::vector<ll>> dp(p,std::vector<ll>(5)); dp[0][0]=1; for(int i=0;i<n;++i){ std::vector<std::vector<ll>>nw(p,std::vector<ll>(5)); for(int rem=0;rem<p;++rem){ for(int cnt=0;cnt<5;++cnt){ if(cnt!=4){ ll add=0; if(cnt==0)add+=ten[i]; else if(cnt==1)add+=nine[i]; else if(cnt==2)add+=seven[i]; else add+=five[i]; ll nrem=rem+add;nrem%=p; nw[nrem][cnt+1]+=dp[rem][cnt]; } nw[rem][cnt]+=dp[rem][cnt]; } } std::swap(nw,dp); } std::cout << dp[q].back() << '\n'; }