F. Shareefeh wants Balilah
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

After Shareefeh moved to Abu Shehab's house the number of snacks became much less and one day Shareefeh craved Balilah, after a while she heard Abu Ghalib calling "Balilah Balbalooky w bel mele7 wel leymoon sala2ooky ya 3zeeez alf lera engleeez".

She stopped Abu Ghalib and asked him to buy Balilah, Abu Ghalib stores his Balilah in a basket that looks like a stack that contains $$$n$$$ Balayel, the $$$i_{th}$$$ one has a tastiness that equals to $$$a_i$$$, where $$$a_1$$$ is the Balilah in the bottom of the stack and $$$a_n$$$ is the Balilah on top of the stack.

Abu Ghalib can remove any number of Balilah from his stack but he can't put them back, so he has to choose an integer $$$k$$$ such that $$$(1 \leq k \leq n)$$$, and remove the $$$k$$$ Balilah that are on top of the stack and sell them to Shareefeh.

Abu Ghalib knows that Shareefeh will sort the Balilah based on its tastiness then she will start eating them one by one starting from the first one (the one with minimum tastiness).

For Shareefeh a sequence of Balilah will provide a better experience than another one if it is lexicographically greater than the other one.

If Shareefeh wasn't satisfied with the Balilah she will tell Abu Shehab and he will kick Abu Ghalib out of Haret AlDabe3, so Abu Ghalib wants to choose an integer $$$k$$$ that gives Shareefeh the best experience.

Can you help Abu Ghalib and tell him the integer $$$k$$$ he should choose such that after taking the top $$$k$$$ Balilah and sorting them by their tastiness the resulting sequence will be lexicographically maximal?

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 Balilah Abu Ghalib 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 tastiness of the $$$i_{th}$$$ Balilah.

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 Balilah Abu Ghalib will sell to Shareefeh.

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

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