#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <bitset>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cassert>
#define int long long
const int N = 2e5 + 7;
using namespace std;
int n,m, a[N],b[N], x;

struct Otr {
    int l, r;
    int ind;
};

bool operator <(Otr a, Otr b) {
    if (a.r == b.r) {
        return a.ind < b.ind;
    }
    return a.r < b.r;
}

set<Otr> s;

vector<Otr> add[N], del[N];
int ans[N];
void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        int x = a[i];
        int l, r;
        if (a[i] != 0) {
            l = i / (a[i] + 1) + 1;
            r = i / a[i];
        }
        else {
            l = i + 1;
            r = n;
        }
        add[l].push_back({ l,r, i });
    }
    s.clear();
    for (int i = 1; i <= n; i++) {
        for (auto u : add[i]) {
            s.insert(u);
        }
        add[i].clear();
        if (s.size()) {
            auto u = *s.begin();
            ans[i] = u.ind;
            s.erase(s.begin());
        }
    }
    for (int i = 1; i <= n; i++) {
        cout << ans[i] << " ";
    }
    cout << "\n";
}

signed main()
{
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
#else
    std::ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}