Problem Statement

You are given a sequence of non-negative integers $A = (A_1, A_2, \cdots, A_N)$ of length $N$.
$A$ has $\frac{N(N + 1)}{2}$ contiguous subarrays. When they are arranged in lexicographic order, output the contiguous subarray at the $K$-th position.

You are given $T$ test cases; find the answer for each of them.

Input

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

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

• $1 \leq T \leq 10^5$
• $1 \leq N \leq 2 \times 10^5$
• $1 \leq K \leq \frac{N(N + 1)}{2}$
• $1 \leq A_i \leq N$
• All input values are integers.
• In $1$ input file, the sum of $N$ does not exceed $5 \times 10^5$.

Output

For each test case, output the contiguous subarray at the $K$-th position in lexicographic order, separated by spaces, followed by a newline.

Sample

3
3 4
2 1 2
4 4
1 2 3 4
17 100
12 3 6 5 6 11 13 1 2 8 2 13 1 14 1 8 7

2
1 2 3 4
8 2 13 1 14 1