#include <bits/stdc++.h>
using namespace std;

#define rep(i, j, n) for (int i = (int)j; i < (int)(n); i++)
using ll = long long int;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;

int main() {
  int N, P, Q;
  cin >> N >> P >> Q;
  vi A(N);
  rep(i, 0, N)
    cin >> A[i];
  sort(A.begin(), A.end());
  vi o = {10, 9, 7, 5};
  vvi a(N, vector<int> (4));
  rep(i, 0, N) {
    rep(j, 0, i+1) {
      int p = 1;
      rep(k, 0, A[i])
	p = ((ll)p * (ll)o[j]) % P;
      a[i][j] = p;
    }
  }
  vvvi y(P, vvi (N, vi (4, -1)));
  auto dfs = [&](auto dfs, int x, int n, int depth, int ans) {
    x = (x + a[n][depth]) % P;
    y[x][n][depth] = x;
    if (depth == 3) {
      if (x % P == Q)
	return ans + 1;
      else
	return ans;
    }
    rep(i, n+1, N) {
      if (y[x][i][depth+1] >= 0)
	ans = y[x][i][depth+1];
      else
	ans = dfs(dfs, x, i, depth+1, ans);
    }
    return ans;
  };
  int ans = 0;
  rep(i, 0, N)
    ans += dfs(dfs, 0, i, 0, 0);
  cout << ans << endl;
  return 0;
}