CF1608B.Build the Permutation

You are given three integers $n, a, b$. Determine if there exists a permutation $p_1, p_2, \ldots, p_n$ of integers from $1$ to $n$, such that:

• There are exactly $a$ integers $i$ with $2 \le i \le n-1$ such that $p_{i-1} \lt p_i \gt p_{i+1}$ (in other words, there are exactly $a$ local maximums).

• There are exactly $b$ integers $i$ with $2 \le i \le n-1$ such that $p_{i-1} \gt p_i \lt p_{i+1}$ (in other words, there are exactly $b$ local minimums).

If such permutations exist, find any such permutation.

给你三个整数 $n, a, b$。判断是否存在一个由 $1$ 到 $n$ 的整数组成的排列 $p_1, p_2, \ldots, p_n$，使得：

• 恰好有 $a$ 个下标 $i$（满足 $2 \le i \le n-1$），使得 $p_{i-1} \lt p_i \gt p_{i+1}$（即恰好有 $a$ 个局部最大值）；

• 恰好有 $b$ 个下标 $i$（满足 $2 \le i \le n-1$），使得 $p_{i-1} \gt p_i \lt p_{i+1}$（即恰好有 $b$ 个局部最小值）。

如果这样的排列存在，请构造出任意一个满足条件的排列。

The first line of the input contains a single integer $t$ ($1 \le t \le 10^4$) — the number of test cases. The description of test cases follows.

The only line of each test case contains three integers $n$, $a$ and $b$ ($2 \leq n \leq 10^5$, $0 \leq a,b \leq n$).

The sum of $n$ over all test cases doesn't exceed $10^5$.

输入的第一行包含一个整数 $t$（$1 \le t \le 10^4$），表示测试用例的数量。随后是各测试用例的描述。

每个测试用例仅一行，包含三个整数 $n$、$a$ 和 $b$（$2 \leq n \leq 10^5$，$0 \leq a,b \leq n$）。

所有测试用例的 $n$ 值之和不超过 $10^5$。

For each test case, if there is no permutation with the requested properties, output $-1$.

Otherwise, print the permutation that you are found. If there are several such permutations, you may print any of them.

对于每个测试用例，若不存在满足要求的排列，则输出 $-1$。

否则，输出你找到的排列。若存在多个满足条件的排列，你可以输出其中任意一个。

In the first test case, one example of such permutations is $[1, 3, 2, 4]$. In it $p_1 \lt p_2 \gt p_3$, and $2$ is the only such index, and $p_2 \gt p_3 \lt p_4$, and $3$ the only such index.

One can show that there is no such permutation for the third test case.

在第一个测试用例中，一个满足条件的排列示例是 $[1, 3, 2, 4]$。其中 $p_1 \lt p_2 \gt p_3$，而 $2$ 是唯一满足该不等式模式的下标；同时 $p_2 \gt p_3 \lt p_4$，而 $3$ 是唯一满足该不等式模式的下标。

可以证明，第三个测试用例不存在满足条件的排列。