#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) { return (ull)rng() % B; }

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,p,q; cin >> n >> p >> q;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector<int> pp = {10, 9, 7, 5};
    vector<vector<int>> v(4, vector<int>(n));
    sort(a.begin(), a.end());
    for (int i = 0; i < 4; ++i) {
        for (int j = 0; j < n; ++j) {
            v[i][j] = modpow(pp[i], a[j], p);
        }
    }
    ll res = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = i+1; j < n; ++j) {
            for (int k = j+1; k < n; ++k) {
                for (int l = k+1; l < n; ++l) {
                    int u = (v[0][i] + v[1][j] + v[2][k] + v[3][l]) % p;
                    res += (u == q);
                }
            }
        }
    }
    cout << res << endl;
}