#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, k;
int a[maxn];
map<vector<pair<int, int> >, int> mp;
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    vector<pair<int, int> > v1;
    for (int cur = 2; cur * cur <= a[i]; cur++) {
      int num = 0;
      while (a[i] % cur == 0) {
        a[i] /= cur;
        num++;
      }
      if (num % k) v1.push_back(make_pair(cur, num % k));
    }
    if (a[i] > 1) v1.push_back(make_pair(a[i], 1 % k));
    vector<pair<int, int> > v2;
    for (int j = 0; j < v1.size(); j++) {
      v2.push_back(make_pair(v1[j].first, k - v1[j].second));
    }
    ans += mp[v2];
    mp[v1]++;
  }
  cout << ans << endl;
  return 0;
}
