#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint;
using vm = vector<mint>;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n,p,q;cin>>n>>p>>q;
  vl A(n);
  rep(i,0,n)cin>>A[i];
  sort(all(A));
  ll ans=0;
  mint::set_mod(p);
  unordered_set<ll> AB;
  mint ss=mint(10).pow(A[0])+mint(9).pow(A[1]);
  AB.insert((ll)ss.val());
  rep(c,2,n-1){
    rep(d,c+1,n){
      mint stc=q-(mint(7).pow(A[c])+mint(5).pow(A[d]));
      ll stc_ll=(ll)stc.val();
      if(AB.count(stc_ll))ans++;
    }
    rep(a,0,c){
      mint val=mint(10).pow(A[a])+mint(9).pow(A[c]);
      AB.insert((ll)val.val());
    }
  }
  cout<<ans<<el;
}