#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;


int main(){
    int N, P; cin >> N >> P;
    vector<int> A(N); rep(i,N) cin >> A[i];
    i64 ans = 0;
    for(int p=P; ; p*=P){
        vector<int> B(N);
        rep(i,N) B[i] = A[i] % p;
        sort(B.begin(), B.end());
        int cnt = 1;
        for(int i=1; i<N; i++){
            if(B[i] == B[i-1]){
                ans += cnt;
                cnt++;
            } else {
                cnt = 1;
            }
        }
        if((i64)p * P > 1'000'000'000) break;
    }
    cout << ans << endl;
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;