#include <bits/stdc++.h>
using namespace std;
long long mp[100000 + 10];
vector<long long> vec[100000 + 10];
vector<long long> c[100000 + 10];
bool vst[100000 + 10];
long long k;
long long v[100000 + 10];
void seive() {
  memset(vst, 0, sizeof(vst));
  for (long long i = 1; i <= 100000; i++) v[i] = i;
  for (int i = 2; i <= 100000; i++)
    if (vst[i] == false) {
      for (int j = i; j <= 100000; j += i) {
        vst[j] = true;
        long long cnt = 0;
        while (v[j] % i == 0) {
          cnt++;
          v[j] /= i;
        }
        if (cnt % k) {
          vec[j].push_back(i);
          c[j].push_back(cnt % k);
        }
      }
    }
}
long long calc(long long ix, int ch) {
  int sz = vec[ix].size();
  long long ret = 1;
  for (long long i = 0; i < sz; i++) {
    int cnt = c[ix][i];
    if (ch) cnt = k - cnt;
    while (cnt--) {
      ret *= vec[ix][i];
      if (ret > 100000) return -1;
    }
  }
  return ret;
}
int main() {
  long long n, a, ans = 0;
  cin >> n >> k;
  seive();
  for (long long i = 1; i <= n; i++) {
    scanf("%I64d", &a);
    long long need = calc(a, true);
    if (need != -1) ans += mp[need];
    need = calc(a, false);
    mp[need]++;
  }
  cout << ans << endl;
  return 0;
}
