#include // cout, endl, cin #include // string, to_string, stoi #include // vector #include // min, max, swap, sort, reverse, lower_bound, upper_bound #include // pair, make_pair #include // tuple, make_tuple #include // int64_t, int*_t #include // printf #include // map #include // queue, priority_queue #include // set #include // stack #include // deque #include // unordered_map #include // unordered_set #include // bitset #include // isupper, islower, isdigit, toupper, tolower #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define ll long long #define ull unsigned long long #define ld long double typedef vector vll; using LL = long long; using ULL = unsigned long long; using VI = vector; using VVI = vector; using VVVI = vector; using VL = vector; using VVL = vector; using VVVL = vector; using VB = vector; using VVB = vector; using VVVB = vector; using VD = vector; using VVD = vector; using VVVD = vector; using VC = vector; using VS = vector; using VVC = vector; using PII = pair; using PLL = pair; using PDD = pair; using PIL = pair; using MII = map; using MLL = map; using SI = set; using SL = set; using MSI = multiset; using MSL = multiset; template using MAXPQ = priority_queue; template using MINPQ = priority_queue< T, vector, greater >; const ll MOD = 1000000007; const ll MOD2 = 998244353; const ll INF = 1LL << 60; #define PI 3.14159265358979323846 #define FOR(i, a, b) for(int i = (a); i < (b); ++i) #define REP(i, n) FOR(i, 0, n) #define EACH(e, v) for(auto &e : v) #define RITR(it, v) for(auto it = (v).rbegin(); it != (v).rend(); ++it) #define ALL(v) v.begin(),v.end() vector x8={1,1,1,0,0,-1,-1,-1},y8={1,0,-1,1,-1,1,0,-1}; int dx4[4]={1,-1,0,0}, dy4[4]={0,0,1,-1}; /* memo -uf,RMQ(segtree),BIT,BIT2,SegTree,SegTreeLazy -isprime,Eratosthenes,gcdlcm,factorize,divisors,modpow,moddiv(modpow必要) nCr(+modnCr,inverse,extend_euclid.powmod),tobaseB,tobase10 -dijkstra,Floyd,bellmanford,sccd,topological,treediamiter -compress1,compress2,rotate90 -co,ci,fo1,fo2,fo3,fo4 -bitsearch,binaryserach -bfs(vis.assign忘れるな) -SegTreedec,SegTreeLazydec */ ll modpow(ll a, ll e, ll mod){ ll res = 1; ll p=e,q=a; while(p){ if(p & 1){ res *= q; res %= mod; } p /= 2; q *= q; res %= mod; } return res; } ll N,P,Q; int main(){ cin.tie(0); ios_base::sync_with_stdio(0); cin >> N >> P >> Q; VL a(N); for(ll i = 0; i < N; i++) cin >> a[i]; sort(ALL(a)); VL p10,p9,p7,p5; for(ll i = 0; i < N; i++){ p10.push_back(modpow(10,a[i],P)); p9.push_back(modpow(9,a[i],P)); p7.push_back(modpow(7,a[i],P)); p5.push_back(modpow(5,a[i],P)); } ll ans = 0; for(ll i = 0; i < N; i++){ for(ll j = i+1; j < N; j++){ for(ll k = j+1; k < N; k++){ for(ll l = k+1; l < N; l++){ ll tmp = p10[i]+p9[j]+p7[k]+p5[l]; if(tmp%P == Q) ans++; } } } } cout << ans << endl; }