#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main() {
	vector<vector<ll>> v;
	int testCases;
	ll a, b;
	scanf("%d", &testCases);

	for(int i = 0; i < testCases; i++) {
		vector<ll> tV;
		scanf("%lld", &a);
		tV.push_back(a);

		for (int j = 0; j < a; j++) {
			scanf("%lld", &b);
			tV.push_back(b);
		}
		v.push_back(tV);
	}

	for (int j = 0; j < testCases; j++) {
		auto test = v[j];
		ll n = test[0];
		vector<ll> positions;

		for (ll i = 0; i < n; i++) positions.push_back(i + 1);

		for (ll i = 1; i < n + 1; i++) {
			rotate(positions.begin() + (i - 1) - test[i], positions.begin() + (i - 1), positions.begin() + i);
		}

		for (ll i = 0; i < n; i++) {
                printf("%lld", positions[i]);
                if (i != n - 1) printf(" ");
        }
		if (j != testCases - 1) printf("\n");
	}
	return 0;
}