#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

using mint = modint;

int main(){
	int n, p, q;
	cin >> n >> p >> q;
	mint::set_mod(p);
	vector<int> a(n);
	cin >> a;
	sort(a.begin(), a.end());
	int ans = 0;
	vector<vector<int>> dp(5, vector<int>(p));
	const int M = 2000005;
	vector<vector<int>> x(4, vector<int>(M));
	rep(i, 4){
		x[i][0] = 1;
		int y = 0;
		if(i == 0) y = 10;
		if(i == 1) y = 9;
		if(i == 2) y = 7;
		if(i == 3) y = 5;
		rep(j, M - 1) x[i][j + 1] = (x[i][j] * y) % p;
	}
//	cout << x;
	dp[0][0] = 1;
	rep(i, n){
		vector<vector<int>> dp_old(5, vector<int>(p));
		swap(dp, dp_old);
		rep(j, 5){
			rep(r, p){
				dp[j][r] += dp_old[j][r];
				if(j <= 3) dp[j + 1][(x[j][a[i]] + r) % p] += dp_old[j][r];
			}
		}
	}
	cout << dp[4][q] << "\n";
	return 0;
}