#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cstdio>
#include <cmath>
#include <cassert>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

int n, p, q;
int a[200];
int ps[11][2000001];

signed main() {
	int i, j, k, l;

	cin >> n >> p >> q;
	
	for (i = 1; i <= 10; i++) {
		ps[i][0] = 1;
		for (j = 1; j <= 2000000; j++) {
			ps[i][j] = ps[i][j - 1] * i;
			ps[i][j] %= p;
		}
	}

	rep(i, n) cin >> a[i];
	sort(a, a + n);
	
	int ans = 0;
	rep(i, n) {
		for (j = i + 1; j < n; j++) {
			for (k = j + 1; k < n; k++) {
				for (l = k + 1; l < n; l++) {
					int val = (ps[10][a[i]] + ps[9][a[j]] + ps[7][a[k]] + ps[5][a[l]]) % p;
					if (val == q) {
						ans++;
					}
				}
			}
		}
	}

	cout << ans << endl;
	return 0;
}