#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);
    vector<vector<int>> b(n+1, vi(p, 0));
    rep(i, n) {
        rep(j, p) {
            b[i+1][j] = b[i][j];
        }
        mint d = 5;
        d = d.pow(A[i]);
        b[i+1][d.val()]++;
    }
    // rep(i, n) {
    //     mint d = 5;
    //     cerr << d.pow(A[i]).val() << " ";
    // }
    // cerr << endl;

    // rep(i, p) {
    //     mint d = 5;
    //     cerr << b[5][i] << " ";
    // }
    // cerr << endl;

    mint t = q;
    int ans = 0;
    rep(i, n-3) {
        rep2(j, i+1, n-2) {
            rep2(k, j+1, n-1) {
                mint ta = 10;
                mint tb = 9;
                mint tc = 7;
                t -= ta.pow(A[i]);
                t -= tb.pow(A[j]);
                t -= tc.pow(A[k]);
                // cerr << i << " " << j << " " << k << " " << t.val() << endl;
                ans += (b[n][t.val()] - b[k][t.val()]);
                // if(b[n][t.val()] - b[k][t.val()] > 0) {
                //     cerr << t.val() << " " << b[n][t.val()] << " " << b[k][t.val()] << endl;
                // }
            }
        }
    }
    cout << ans << endl;
    return 0;
}