#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n+1); i++)
#define repn(i,a,b) for (int i = (int)(a) ; i < (int)(b+1); i++)
#define repv(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) ((int)(x).size())
#define uni(v) v.erase(unique(v.begin(), v.end()), v.end());
using ll = long long;
using P = pair<int,int>;
using mint = modint998244353;
ostream& operator<< (ostream& os, const mint &x) {os << x.val(); return os;}
#ifdef LOCAL
    #include <debug.hpp>
    #define debug(...) debug::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
    #define debug(...) (static_cast<void>(0))
#endif


int main(){
    int n,p;
    cin >> n >> p;
    vector<int> a(n);
    for(auto &x : a) cin >> x;
    vector<map<int,int>> amari;
    ll powp = p, max_a = *max_element(all(a));
    while(powp <= max_a){
        map<int,int> mp;
        for(auto x : a){
            mp[x % powp]++;
        }
        amari.push_back(mp);
        powp *= p;
    }

    ll ans = 0;
    for(int i = 0; i < sz(amari); i++){
        for(auto p: amari[i]){
            ans += ((ll)p.second*(p.second-1)/2);
        }
    }
    cout << ans << endl;
    return 0;
}