Toph is playing a card game. She has $$$n$$$ cards and each card has a unique number of $$$1,2\cdots n$$$. In this game, Toph can operate the deck of the cards. We may wish to assume that the cards from the top to the bottom of the deck are $$$p_1,p_2,\cdots p_n$$$ (a permutation), then each operation must be one of the following two cases:
Now, you know that the initial order(from top to bottom) of Toph's deck is $$$a_1,a_2,\cdots a_n$$$, and Toph wants to change the order of the deck into $$$b_1,b_2,\cdots b_n$$$ after some operations. Please construct the operation sequence to help Toph implement the change.
Toph has no patience. So the number of operations should not exceed $$$n^2$$$.
The first line contains an integer $$$T$$$ , indicating the number of test cases.
For each test case:
It is guaranteed that the sum of $$$n$$$ in $$$T$$$ test cases is not exceed $$$1000$$$.
For each test case:
231 2 32 3 141 2 3 42 1 3 4
1112212
If $$$a_1,a_2\cdots a_n$$$ and $$$b_1,b_2\cdots b_n$$$ are the same in a test case, outputing an empty string is ok. But you should output an empty line in this situation.
DO NOT add extra space at the end of lines, or you will get "Wrong Answer" verdict.
| Name |
|---|


