/*
         --┬--  |     |  --┬--                |       |
           |    |\    |    |                  |       |
           |    | \   |    |     ----->       |       |
           |    |  \  |    |                  |       |
           |    |   \ |    |                  |       |
         --┴--  |    \|    |                  └----   └----

*/

#define pragma

#ifdef pragma
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#endif // pragma

#include<bits/stdc++.h>

#define ll long long
#define all(x) begin(x),end(x)
#define pb push_back
#define x first
#define y second
#define INF 9223372036854775807ll;
#define PI 3.14159265359d
#define INPUT "input.txt"
#define OUTPUT "output.txt"

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long double ld;

void seriy() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

vi a;

int main(){
    seriy();
    int n, k;
    cin >> n >> k;
    a.resize(n);
    map<int, int> mp1;
    map<int, int> mp2;
    ll sum = 0;
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        if(a[i] % (k * k) == 0 && mp2[a[i] / k] && mp1[a[i] / (k * k)]) sum += mp2[a[i] / k];
        if(a[i] % k == 0 && mp1[a[i] / k]) mp2[a[i]] += mp1[a[i] / k];
        mp1[a[i]]++;
    }
    cout << sum;
    return 0;
}