#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, p, c;
  cin >> n >> p >> c;
  VI a(n);
  rep(i, n) cin >> a[i];
  ll ans = 0;
  if (c == 0) {
    int last = -1;
    rep(i, n) {
      if (a[i] == 0) last = i;
      ans += last + 1;
    }
  } else {
    VI s(n + 1);
    map<int, int> mp;
    for (int l = 0, r = 1; l < n; l = r++) {
      if (!a[l]) continue;
      while (r < n && a[r]) r++;
      s[l] = 1;
      for (int i = l; i < r; i++) s[i+1] = (ll)s[i] * a[i] % p;
      mp.clear();
      for (int i = r; i >= l; i--) {
        auto it = mp.find((ll)s[i] * c % p);
        if (it != mp.end()) ans += it->second;
        mp[s[i]]++;
      }
    }
  }
  cout << ans << '\n';
}