#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int n, p;
    cin >> n >> p;
    VI a(n);
    rep(i, n) {
      int x;
      cin >> x;
      a[x-1] = i;
    }
    VI b(n);
    VVI todo(n + 1);
    vector<char> visited(n);
    rep(i, n) if (!visited[i]) {
      int v = i;
      VI vs;
      while (!visited[v]) visited[v] = true, vs.emplace_back(v), v = a[v];
      int sz = vs.size();
      if (sz % 2) {
        // b = (b^2p)^x = a^x
        auto [g, x] = internal::inv_gcd(2*p, sz);
        assert(g == 1);
        rep(i, sz) b[vs[i]] = vs[(i+x) % sz];
      } else if (todo[sz].empty()) {
        todo[sz] = move(vs);
      } else {
        VI us;
        swap(us, todo[sz]);
        auto [g, x] = internal::inv_gcd(p, sz);
        assert(g == 1);
        rep(i, sz) {
          b[vs[i]] = us[i];
          b[us[i]] = vs[(i+x) % sz];
        }
      }
    }
    rep(sz, n + 1) if (!todo[sz].empty()) {
      VI vs = move(todo[sz]);
      auto [g, x] = internal::inv_gcd(2*p, sz-1);
      assert(g == 1);
      rep(i, sz-1) b[vs[i]] = vs[(i+x) % (sz-1)];
      int v = vs[0];
      rep(_, sz - 1 - 2*p % (sz-1)) v = b[v];
      b[vs[sz-1]] = v;
    }
    rep(i, n) cout << b[i]+1 << " \n"[i + 1 == n];
  }
}