#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
template<class T> using graph=vector<vector<T>>;
template<class T> using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
constexpr int INF32=INT_MAX/2;
constexpr ll INF64=1LL<<60;
constexpr array<int,4> DX4={0,1,0,-1};
constexpr array<int,4> DY4={-1,0,1,0};
constexpr array<int,8> DX8={0,1,1,1,0,-1,-1,-1};
constexpr array<int,8> DY8={-1,-1,0,1,1,1,0,-1};
inline int popcnt(ll n){return __builtin_popcountll(n);}
template<class T> inline bool chmax(T& a,const T& b){return a<b?a=b,true:false;}
template<class T> inline bool chmin(T& a,const T& b){return b<a?a=b,true:false;}
#define rep(i,s,n) for(ll i=(ll)(s);i<(ll)(n);i++)
#define rrep(i,s,n) for(ll i=(ll)(s);i>=(ll)(n);i--)
void _main();
int main(){
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout<<fixed<<setprecision(16);
	_main();
}

#include <atcoder/modint>
using atcoder::modint;

void _main(){
	int N, P, Q; cin >> N >> P >> Q;
	vector<ll> A(N); rep(i,0,N) cin >> A[i];

	sort(A.begin(), A.end());

	modint::set_mod(P);

	vector<modint> pow10(N), pow9(N), pow7(N), pow5(N);
	rep(i,0,N){
		pow10[i] = modint(10).pow(A[i]);
		pow9[i] = modint(9).pow(A[i]);
		pow7[i] = modint(7).pow(A[i]);
		pow5[i] = modint(5).pow(A[i]);
	}

	modint q = modint(Q);

	int ans = 0;
	rep(i,0,N) rep(j,i+1,N) rep(k,j+1,N) rep(l,k+1,N){
		modint a = pow10[i], b = pow9[j], c = pow7[k], d = pow5[l];
		if(a+b+c+d==q) ans++;
	}
	cout << ans << endl;
}