D. Shareefeh eats Kebbeh Dabbabeh
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

So3ad 5anom organized a 3azeemeh in her house for neswan Al7arah to eat Kebbeh Dabbabeh and enjoy the atmosphere together.

After Em Zekki finished roasting the Kebbeh, she put the Kebbeh in a bag that looks like a stack that contains $$$n$$$ Kebbeh. The $$$i_{th}$$$ one has a size that equals $$$a_i$$$, where $$$a_1$$$ is the Kebbeh at the bottom of the stack and $$$a_n$$$ is the Kebbeh on top of the stack.

Shareefeh saw 7ameedeh eating lots of Kebbeh, then she told her not to eat too much so she doesn't become fat like Em Zekki. 7ameedeh didn't listen and continued eating because the Kebbeh was so delicious.

Shareefeh also wants to eat Kebbeh, but she doesn't want to get fat so she can marry Abu Shehab.

Shareefeh can remove any number of Kebbeh from the bag, but she can't put them back. So, she has to choose an integer $$$k$$$ such that $$$(1 \leq k \leq n)$$$ and remove the $$$k$$$ Kebbeh that are on top of the stack to eat them.

Shareefeh will sort the Kebbeh based on its size, then she will start eating them one by one, starting from the first one (the one with the minimum size).

For Shareefeh, a sequence of Kebbeh will make her gain more weight than another one if it is lexicographically greater than the other one.

Shareefeh wants to eat Kebbeh but doesn't want to gain too much weight, so she wants to choose an integer $$$k$$$ that makes her gain the minimum possible weight.

Can you help Shareefeh and tell her the integer $$$k$$$ she should choose such that after taking the top $$$k$$$ Kebbeh and sorting them by their size, the resulting sequence will be lexicographically minimal?

Input

The first line of input will contain one integer $$$T$$$, which is the number of test cases $$$(1 \leq T \leq 10^4)$$$.

For each test case:

The first line of input will contain one integer $$$n$$$ $$$(1 \leq n \leq 2 \cdot 10^5)$$$, which is the number of Kebbeh Shareefeh has.

The second line will contain $$$n$$$ integers, the $$$i_{th}$$$ one, denoted by $$$a_i$$$ $$$(1 \leq a_i \leq 10^9)$$$, representing the size of the $$$i_{th}$$$ Kebbeh.

It is guaranteed that the sum of $$$n$$$ across all test cases will not exceed $$$2 \cdot 10^5$$$.

Output

For each test case, print an integer $$$k$$$ on the first line, which represents the number of Kebbeh Shareefeh will take.

On the second line, print $$$k$$$ integers that represent the sequence of Kebbeh Shareefeh will eat.

Example
Input
3
1
100
4
1 2 3 4
4
4 3 2 1
Output
1
100
4
1 2 3 4
1
1