#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll N, P; cin >> N >> P;
    vector<ll> A(N); rep(i, N) cin >> A[i];

    ll ans = 0;
    ll PP = P;
    while(PP <= 1e9){
        vector<ll> B(N); rep(i, N) B[i] = A[i]%PP;

        ll cnt = 0;
        map<ll, ll> mp;
        rep(i, N){
            cnt += mp[B[i]];
            mp[B[i]]++;
        }

        ans += cnt;
        PP *= P;
    }

    cout << ans << endl;
}