#include <bits/stdc++.h>
using namespace std;
long long int power(long long int a, long long int b) {
  if (b == 0) return 1;
  if (b == 1) return a;
  long long int r = power(a, b / 2) % 1000000007;
  if (b % 2 == 0)
    return (r * r) % 1000000007;
  else
    return (((r * r) % 1000000007) * a) % 1000000007;
}
int prime[1000009];
int sumprime[1000009];
void sieve(int n) {
  prime[0] = prime[1] = 1;
  for (int i = 2; i <= sqrt(n); i++) {
    if (!prime[i]) {
      for (int j = 2 * i; j <= n; j = j + i) {
        prime[j]++;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    if (!prime[i]) {
      sumprime[i] = sumprime[i - 1] + 1;
    } else {
      sumprime[i] = sumprime[i - 1];
    }
  }
}
bool comp(const pair<long long int, long long int> &a,
          const pair<long long int, long long int> &b) {
  return (a.second < b.second);
}
const int N = 5 * 1e5 + 9;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, k;
  cin >> n >> k;
  long long int a[n];
  map<long long int, long long int> mp, mp1;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    mp[a[i]]++;
  }
  if (k == 1) {
    long long int sum = 0;
    for (auto it : mp) {
      long long int val = it.second;
      sum += val * (val - 1) * (val - 2) / 6;
    }
    cout << sum << "\n";
    return 0;
  }
  long long int sum = 0;
  if (mp[a[0]] == 1)
    mp.erase(a[0]);
  else {
    mp[a[0]]--;
  }
  mp1[a[0]]++;
  for (int i = 1; i < n; i++) {
    if (a[i] % k) {
      if (mp[a[i]] == 1) {
        mp.erase(a[i]);
      } else {
        mp[a[i]]--;
      }
      mp1[a[i]]++;
      continue;
    } else {
      if (a[i] == 0 && mp1.find(0) != mp1.end()) {
        sum += (mp[a[i] * k] - 1) * mp1[a[i] / k];
      } else if (mp.find(a[i] * k) != mp.end() &&
                 mp1.find(a[i] / k) != mp1.end()) {
        sum += (mp[a[i] * k]) * (mp1[a[i] / k]);
      }
    }
    if (mp[a[i]] == 1) {
      mp.erase(a[i]);
    } else {
      mp[a[i]]--;
    }
    mp1[a[i]]++;
  }
  cout << sum << "\n";
  return 0;
}
