#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
using i8 = int8_t;
using i32 = int;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;
using ll = long long;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  _main();
}

i64 pow(i64 x, i64 n) {
  i64 res = 1;
  while (n > 0) {
    if (n & 1)
      res *= x;
    x *= x;
    n >>= 1;
  }
  return res;
}

i64 pow(i64 x, i64 n, i64 m) {
  i64 res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * x % m;
    x = x * x % m;
    n >>= 1;
  }
  return res;
}

const i64 inf = 1ll << 60;

void _main() {
  i64 n, p, q;
  cin >> n >> p >> q;
  vector<i64> a(n);
  for (i64 i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  vector<vector<i64>> dp(5, vector<i64>(p, 0));
  vector<i64> m = {10, 9, 7, 5};
  dp[0][0] = 1;
  for (i64 i = 0; i < n; i++) {
    for (i64 j = 3; j >= 0; j--) {
      for (i64 k = 0; k < p; k++) {
        dp[j + 1][(k + pow(m[j], a[i], p)) % p] += dp[j][k];
      }
    }
  }
  cout << dp[4][q] << "\n";
}