//预处理O(N)
//查询O(logM)
//组合数公式
#include<iostream>
#include<vector>
#include<map>
#include<queue>
#include<string>
#include<cstring>
#include<algorithm>
#define int long long
using namespace std;
const int N = 1e6 + 7;
pair<int, int> p[N];
void solve() {
    int n;
    cin >> n;
    bool vis = true;
    for (int i = 1; i <= n; i++) {
        cin >> p[i].first;
        if (p[i].first != p[i - 1].first + 1) {
            vis = false;
        }
        p[i].second = i;
    }

    if (vis) {
        for (int i = 1; i <= n; i++) {
            cout << i << ' ';
        }
        cout << endl;
        return;
    }

    sort(p + 1, p + 1 + n);

    vector<int> res;

    int idx1 = 1,idx2 = n;
    int cnt = 0;
    while (idx1 <= idx2) {
        if(cnt % 2 == 0)res.push_back(p[idx2--].second);
        else res.push_back(p[idx1++].second);
        cnt++;
    }

    for (auto it : res) {
        cout << it << ' ';
    }
    cout << endl;

}
signed main() {
    std::ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int T = 1;
    cin >> T;
    while(T--)solve();
    return 0;
}