#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 2e5 + 5;

int T, n;
int p[N], q[N];

void solve() {
	std::cin >> n; int ans1 = 0, ans2 = 0, max = 0;
	for (int i = 1; i <= n; i++) std::cin >> p[i], q[p[i]] = i;
	for (int i = 1; i <= n; i++) max = std::max(max, p[i]), ans1 += p[i] == max;
	max = 0;
	for (int i = 1; i <= n; i++) max = std::max(max, q[i]), ans2 += q[i] == max;
	if (ans1 > ans2) for (int i = 1; i <= n; i++) std::cout << i << " \n"[i == n];
	else for (int i = 1; i <= n; i++) std::cout << q[i] << " \n"[i == n];
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	std::cin >> T;
	while (T--) solve();

	return 0;
}