#include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <fstream>
using namespace std;
void stress();
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
//    srand(time(0));
    stress();
}

#define int long long

void stress()
{
    ifstream cin("game.in");
    ofstream cout("game.out");
    int n,k;
    cin >> n >> k;
    vector<int> a(n);
    vector<int> cnt(n);
    map<int,int> m;
    for (int i = 0; i<n; i++) {
        cin >> a[i];
        m[a[i]]++;
    }
    map<int,int> was;
    sort(a.begin(),a.end());
    vector<pair<int,int>> b;
    int ans = 0;
    for(int j = 0; j<n; j++)
    {
        if (was[a[j]])
            continue;
        was[a[j]] = 1;
        b.push_back({a[j],m[a[j]]});
        if (b.back().second>2)
            ans++;
    }
    int r = 0;
    for (int i = 0; i<b.size(); i++) {
        while (r < b.size() && b[r].first <= b[i].first * k) {
            r++;
        }
        r--;
        int len = r - i;
        ans += 3 * len * (len - 1);
        if (b[i].second>1)
        {
            ans+=3*len;
        }
    }
    int l = b.size()-1;
    for (int i = b.size()-1; i>=0; i--)
    {
        while (l>=0 && b[l].first*k>=b[i].first)
            l--;
        l++;
        int len = i-l;
        if (b[i].second>1)
            ans+=3*len;
    }
    cout << ans;

}