K. Kempt Kale
time limit per test
2 seconds
memory limit per test
1024 megabytes
input
standard input
output
standard output

Mr. Nežmah has started a kale farm. He wants to grow a total of $$$n$$$ pieces of kale in the following $$$2n$$$ days. On the $$$i$$$-th day, Nežmah can:

  • plant a piece of kale with tastiness $$$a_i$$$,
  • harvest a piece of kale.
Of course, every time Nežmah decides to harvest a piece of kale, there must exist at least one piece that was planted on a prior day and hasn't been harvested yet.

The total tastiness is equal to the sum of the tastiness of all kale Nežmah harvests. Help Nežmah devise a plan to maximize the total tastiness!

Input

The first line contains a single integer $$$t$$$ ($$$1 \leq t \leq 2 \cdot 10^4$$$) — the number of test cases.

The first line of each test case contains a single integer $$$n$$$ ($$$1 \leq n \leq 2 \cdot 10^5$$$).

The second line of each test case contains the array $$$a$$$ ($$$1 \leq a_i \leq 10^9$$$).

It's guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$2 \cdot 10^5$$$.

Output

For each test case, output $$$n$$$ numbers, the days Nežmah should plant kale. If there are multiple solutions, you can output any of them.

Example
Input
3
1
4 3
3
1 2 4 9 6 3
2
5 100 100 200
Output
1 
1 3 4 
1 3
Note

In the 1st test case, the maximum tastiness is $$$4$$$.

In the 2nd test case, the maximum tastiness is $$$1+4+9=14$$$.

In the 3rd test case, the maximum tastiness is $$$5+100=105$$$. Note that {1, 2} would be accepted as well, as it gives the same sum.