#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, p, q; cin >> n >> p >> q;
	vector<int>a(n);
	rep(i, n)cin >> a[i];
	vector<long long>mod10(2000006);
	vector<long long>mod9(2000006);
	vector<long long>mod7(2000006);
	vector<long long>mod5(2000006);
	mod10[0] = mod9[0] = mod7[0] = mod5[0] = 1;
	rep2(i, 1, 2000006) {
		mod10[i] = (mod10[i - 1] * 10) % p;
		mod9[i] = (mod9[i - 1] * 9) % p;
		mod7[i] = (mod7[i - 1] * 7) % p;
		mod5[i] = (mod5[i - 1] * 5) % p;
	}
	int ans = 0;
	rep(i, n)rep2(j, i + 1, n)rep2(k, j + 1, n)rep2(l, k + 1, n) {
		int m = mod10[a[i]];
		m += mod9[a[j]];
		m += mod7[a[k]];
		m += mod5[a[l]];
		m %= p;
		if (q == m) ans++;
	}
	cout << ans << endl;
	return 0;
}