#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, P;
  cin >> N >> P;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  long long ans = 0;
  long long x = P;
  while (true){
    map<int, int> mp;
    for (int i = 0; i < N; i++){
      ans += mp[A[i] % x];
      mp[A[i] % x]++;
    }
    x *= P;
    if (x > 1000000000){
      break;
    }
  }
  cout << ans << endl;
}