#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    ll N, P, ans=0, log=0, B;
    cin >> N >> P;
    B = 1;
    while(B <= 1e9/P){
        B *= P;
        log++;
    }

    vector<ll> A(N);
    for (int i=0; i<N; i++) cin >> A[i];

    B = P;
    for (int i=0; i<log; i++){
        map<ll, ll> mp;
        for (ll j=0; j<N; j++){
            ans += mp[A[j] % B];
            mp[A[j] % B]++;
        }
        B *= P;
    }

    cout << ans << endl;

    return 0;
}