#include<bits/stdc++.h>
#include<atcoder/all>
#define chmin(x,y) (x) = min((x),(y))
#define chmax(x,y) (x) = max((x),(y))
#define ld long double
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
const ll mod = 998244353;
// using Graph = vector<vector<pair<int,int>>>;
using Graph = vector<vector<int>>;
const vector<int> dx = {1,0,-1,0}, dy = {0,1,0,-1};

int main(){
  // input
  int N,P,Q; cin >> N >> P >> Q;
  vector<int> A(N);
  for(int i = 0; i < N; i++){
    cin >> A[i];
  }
  // prep
  const int M = int(2e6+1);
  sort(A.begin(),A.end());
  vector<int> t(M,1), n(M,1), s(M,1), f(M,1);
  for(int i = 0; i < M; i++){
    t[i+1] = (t[i] * 10) % P;
    n[i+1] = (n[i] * 9) % P;
    s[i+1] = (s[i] * 7) % P;
    f[i+1] = (f[i] * 5) % P;
  }
  
  // solve
  int ans = 0;
  for(int i = 0; i < N; i++){
    for(int j = i+1; j < N; j++){
      if(A[i] == A[j]) continue;
      for(int k = j+1; k < N; k++){
        if(A[k] == A[j]) continue;
        for(int l = k+1; l < N; l++){
          if(A[k] == A[l]) continue;
          
          int tmp = t[A[i]] + n[A[j]] + s[A[k]] + f[A[l]];
          if(tmp % P == Q) ans++;
        }
      }
    }
  }
  
  cout << ans << endl;
}