Special Permutation

构造一个长度为 $n$ 的序列 $p$，使得 $p_{[1,{\frac{n}{2}}]}$ 中的最小值为 $a$，使得 $p_{[{\frac{n}{2}} + 1, n]}$ 中的最大值为 $b$。如果没有合法的序列，输出 $-1$。 感谢 @[rsg23](https://www.luogu.com.cn/user/384498) 提交的翻译

A permutation of length $ n $ is an array $ p=[p_1,p_2,\dots, p_n] $ which contains every integer from $ 1 $ to $ n $ (inclusive) exactly once. For example, $ p=[4, 2, 6, 5, 3, 1] $ is a permutation of length $ 6 $ . You are given three integers $ n $ , $ a $ and $ b $ , where $ n $ is an even number. Print any permutation of length $ n $ that the minimum among all its elements of the left half equals $ a $ and the maximum among all its elements of the right half equals $ b $ . Print -1 if no such permutation exists.

The first line of the input contains one integer $ t $ ( $ 1 \le t \le 1000 $ ), the number of test cases in the test. The following $ t $ lines contain test case descriptions. Each test case description contains three integers $ n $ , $ a $ , $ b $ ( $ 2 \le n \le 100 $ ; $ 1 \le a,b \le n $ ; $ a \ne b $ ), where $ n $ is an even number (i.e. $ n \bmod 2 = 0 $ ).

For each test case, print a single line containing any suitable permutation. Print -1 no such permutation exists. If there are multiple answers, print any of them.

7
6 2 5
6 1 3
6 4 3
4 2 4
10 5 3
2 1 2
2 2 1

4 2 6 5 3 1
-1
6 4 5 1 3 2 
3 2 4 1 
-1
1 2 
2 1