#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
long long n, k, a[N];
map<vector<pair<int, int> >, int> cnt;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    long long tmp = a[i];
    vector<pair<int, int> > prDiv, findDiv;
    for (int j = 2; j <= sqrt(tmp); j++) {
      if (tmp % j == 0) {
        int cnt = 0;
        while (tmp % j == 0) {
          tmp /= j;
          cnt++;
        }
        if (cnt % k != 0) {
          prDiv.push_back({j, cnt % k});
          findDiv.push_back({j, k - (cnt % k)});
        }
      }
    }
    if (tmp > 1) {
      prDiv.push_back({tmp, 1});
      findDiv.push_back({tmp, k - 1});
    }
    ans += cnt[findDiv];
    cnt[prDiv]++;
  }
  cout << ans;
}
