#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<ctime>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<map>
using namespace std;
typedef long long LL;
const int MR=1e5+10;
int n;
LL p,a[MR];
int main(){
    cin>>n>>p;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    LL mod=1;
    LL ans=0;
    while(mod*p<2e9){
        mod*=p;
        map<LL,int> cnt;
        for(int i=1;i<=n;i++){
            cnt[a[i]%mod]++;
        }
        for(auto x:cnt){
            ans+=1ll*(x.second-1)*x.second/2;
        }
    }
    cout<<ans<<endl;
    return 0;
}