Given $n$ sheets of paper, place them on the table in pile and fold them in half $k$ times from left to right.
Now from top to bottom, mark a number on paper at each side of the front and back. So there are $2 \times n \times 2^k$ numbers in total and these numbers form a
permutation $P$.
Now it expands to its original. These numbers from top to bottom, from front to back, from left to right form a permutation $Q$.
Given the permutation $P$, find the permutation $Q$.
See example for details.
For $k=1$ and $P=1..4 \times n$, you can assume that you are marking the page numbers before printing a booklet forming from $n$ pieces of $A4$ papers.
Input
The first line contains a single integer $T(1 \leq T \leq 30)$ , the number of test cases.
For each test case, the first line gives two integers $n$, $k$($1 \leq n \leq 200, 1 \leq k \leq 10$).
The next line gives the permutation $P$ that consists of $2 \times n \times 2^k$ integers $p_i(1 \leq p_i \leq 2 \times n \times 2^k)$.
It is guaranteed that $ \sum 2 \times n \times 2^k$ doesn't exceed $10^6$.
Output
The output should contain $T$ lines each containing $2 \times n \times 2^k$ integers separated by spaces, indicating the permutation $Q$.