#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
  #include "settings/debug.cpp"
  #define _GLIBCXX_DEBUG
#else
  #define Debug(...) void(0)
#endif
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

#include <atcoder/modint>
using mint = atcoder::dynamic_modint<1>;

int main() {
  int n, p, q;
  cin >> n >> p >> q;
  mint::set_mod(p);
  vector<int> a(n);
  rep(i, n) cin >> a[i];
  sort(a.begin(), a.end());
  vector cnt(n + 1, vector<int>(p, 0));
  for (int i = n - 1; i >= 0; i--) {
    mint x = mint(5).pow(a[i]);
    for (int j = 0; j < p; j++) {
      cnt[i][j] = cnt[i + 1][j];
      if (x.val() == j) cnt[i][j]++;
    }
  }
  ll ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      for (int k = j + 1; k < n; k++) {
        mint rem = mint(q) - mint(10).pow(a[i]) - mint(9).pow(a[j]) - mint(7).pow(a[k]);
        ans += cnt[k + 1][rem.val()];
      }
    }
  }
  cout << ans << endl;
  return 0;
}