lis

You are given a sequence $A=[A_1,A_2,\cdots,A_N]$ of length $N$.

Print any longest strictly increasing subsequence of $A$. A subsequence is obtained by deleting zero or more elements while preserving the order of the remaining elements.

The input is given in the following format:

$T$ $\mathrm{case}_1$ $\mathrm{case}_2$ $\vdots$ $\mathrm{case}_T$

Each case is given in the following format:

$N$ $A_1\ A_2\ \cdots\ A_N$

For each case, print the length $K$ of a longest increasing subsequence on one line. On the next line, print the $K$ elements of such a subsequence separated by spaces.

If several longest increasing subsequences exist, you may print any of them.

• $1\leq T\leq100\,000$.
• $1\leq N\leq500\,000$.
• $-10^9\leq A_i\leq10^9$ ($1\leq i\leq N$).
• The sum of $N$ over all cases is at most $500\,000$.