#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ln cout<<'\n'
#define ll long long
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.12f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

ll mod_pow(ll x,ll n,ll mod){
  if(!n)return 1;
  ll res=mod_pow(x*x%mod,n/2,mod);
  if(n&1)res=res*x%mod;
  return res;
}

void Main() {
  ll n,x,y;
  cin >> n >> x >> y;
  ll a[n];
  rep(i,n) cin >> a[i];
  sort(a,a+n);
  ll d1[n],d2[n],d3[n],d4[n];
  rep(i,n) {
    d1[i]=mod_pow(10,a[i],x);
    d2[i]=mod_pow(9,a[i],x);
    d3[i]=mod_pow(7,a[i],x);
    d4[i]=mod_pow(5,a[i],x);
  }
  ll d[x];
  mem(d);
  ll ans=0;
  rep(i,n) {
    REP(j,i+1,n) {
      REP(k,j+1,n) {
        ll c=d2[i]+d3[j]+d4[k];
        c%=x;
        ll z=(y+x-c)%x;
        ans+=d[z];
      }
    }
    d[d1[i]]++;
  }
  pr(ans);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}