#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());
    ll ans=0;
    for(int i=0;i<n-3;++i){
        for(int j=i+1;j<n-2;++j){
            for(int k=j+1;k<n-1;++k){
                for(int m=k+1;m<n;++m){
                    ll val=power(10, A[i], p);
                    val+=power(9, A[j], p);val%=p;
                    val+=power(7, A[k], p);val%=p;
                    val+=power(5, A[m], p);val%=p;
                    if(val==q){
                        ++ans;
                    }
                }
            }
        }
    }
    std::cout << ans << '\n';
}