#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

void solve() {
  int n;
  cin >> n;
  vector<int> p(n);
  for (int i = 0 ; i < n; ++i) {
    cin >> p[i];
    --p[i];
  }
  vector<int> q1;
  vector<int> used(n);
  for (int i = 0; i < n; ++i) {
    for (int j = i; !used[j]; j = p[j]) {
      q1.push_back(j);
      used[j] = true;
    }
  }
  vector<int> q(n);
  for (int i = 0; i < n; ++i) {
    q[q1[i]] = i;
  }
  for (int i = 0; i < n; ++i) {
    cout << q[i] + 1 << " ";
  }
  cout << "\n";
}


int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);

  int tst;
  cin >> tst;
  while (tst--) {
    solve();
  }

  
  return 0;
}