#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T>
vector<pair<T, int>> factorize(T x) {
  vector<pair<T, int>> res;
  for (T i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      res.emplace_back(i, 0);
      while (x % i == 0) {
        res.back().second++;
        x /= i;
      }
    }
  }
  if (x > 1) {
    if (!res.empty() && res.back().first == x)
      res.back().second++;
    else
      res.emplace_back(x, 1);
  }
  return res;
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  int n, k;
  cin >> n >> k;
  map<vector<pair<int, int>>, int> cnt;
  ll res = 0;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    auto fs = factorize(a);
    vector<pair<int, int>> tf;
    for (auto p : fs) {
      p.second %= k;
      if (p.second != 0) tf.push_back(p);
    }
    res += cnt[tf];
    for (auto& p : tf) {
      p.second = k - p.second;
    }
    cnt[tf] += 1;
  }
  cout << res << endl;
  return 0;
}
