#include <bits/stdc++.h>
#include <atcoder/modint>
// #include <atcoder/lazysegtree>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for(int i = (s); i < (int)(n); i++)
#define printYN(check) cout << ((check)? "Yes" : "No") << endl
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define NUM 998244353
#define IMAX INT_MAX
#define LMAX LONG_MAX
using namespace std;
using namespace atcoder;
using mint = modint;
// using mint = modint998244353;
// using mint = modint1000000007;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using tii = tuple<int, int, int>;
using mii = map<int, int>;
// using Graph = vvi;
// Graph graph(n);
// vi dx = {-1, 0, 1, -1, 1, -1,  0, 1};
// vi dy = { 1, 1, 1,  0, 0, -1, -1,-1};

template<typename T> bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }

// snippet -> {UnionFind, dfs_reculsive, dfs_stack, is_prime, mypow, print_array, 
//             bfs_queue, digsum, binary_search, gcd, Dijkstra, bitsearch,
//             next_combination, binomial}
// -------------------------------------------------------------------------

int main() {
    int n, p, q;
    cin >> n >> p >> q;
    vi A(n);
    rep(i, n) cin >> A[i];
    sort(all(A));
    modint::set_mod(p);
    mint t = 0;
    int ans = 0;
    rep(i, n) {
        rep2(j, i+1, n) {
            rep2(k, j+1, n) {
                rep2(h, k+1, n) {
                    mint ta = 10;
                    mint tb = 9;
                    mint tc = 7;
                    mint td = 5;
                    t = ta.pow(A[i]) + tb.pow(A[j]) + tc.pow(A[k]) + td.pow(A[h]);
                    // printf("%d %d %d %d %d\n", ta.pow(A[i]), tb.pow(A[j]), tc.pow(A[k]), td.pow(A[h]), t);
                    if(t == q) ans++;
                }
            }
        }
    }
    cout << ans << endl;
    return 0;
}