#include <bits/stdc++.h>
using namespace std;
int n, k, ff[500005], f[500005], num[500005], isp[500005], x;
vector<int> pri[500005];
int main() {
  cin >> n >> k;
  f[1] = 1;
  ff[1] = 1;
  for (int i = (2); i <= (1e5); i++) {
    if (isp[i]) continue;
    for (int j = i; j <= 1e5; j += i) {
      isp[j] = 1;
      pri[j].push_back(i);
    }
  }
  for (int i = (2); i <= (1e5); i++) {
    int sum = 1, ss = 1;
    for (int x : pri[i]) {
      int y = i, b = 0;
      while (y % x == 0) y /= x, b++;
      b %= k;
      if (!b) continue;
      for (int j = (1); j <= (b); j++) sum *= x;
      for (int j = (b + 1); j <= (k); j++)
        if (1ll * ss * x > 1e5)
          ss = 0;
        else
          ss *= x;
    }
    ff[i] = sum;
    f[i] = ss;
  }
  long long ans = 0;
  for (int i = (1); i <= (n); i++)
    scanf("%d", &x), ans += num[f[x]], num[ff[x]]++;
  printf("%lld\n", ans);
}
