|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|2 초||512 MB||0||0||0||0.000%|
Lin-Manuel is moving along a strip consisting of $n$ cells consecutively numbered from 1 to $n$.
He starts at cell $a$ and want to finish at cell $b$. In the process, he wants to visit every cell exactly once.
From any cell $x$, Lin-Manuel can walk to the neighboring cell on the left, cell $x - 1$ (if it exists), or on the right, cell $x + 1$ (if it exists).
He can also call for his friend, witch Miranda, who will grant him a magic power. With this power, he will be able to fly exactly once from his current cell $x$ to any cell $y$ such that the greatest common divisor of $x$ and $y$ is 1.
Lin-Manuel doesn't want to burden Miranda too much. Thus, he would like to achieve his goal flying as few times as possible.
Help him and find the smallest number of flights required along with the optimal sequence of visiting cells.
The first line of the input contains a single integer $t$ ($1 \le t \le 10^3$) --- the number of test cases.
Each of the next $t$ lines contains three integers $n$, $a$, and $b$ ($2 \le n \le 2 \cdot 10^5$; $1 \le a, b \le n$; $a \ne b$) --- the number of cells on the strip, the starting cell, and the finishing cell, respectively.
The sum of all values of $n$ doesn't exceed $2 \cdot 10^5$.
For each test case, if it's impossible to achieve the goal with any number of flights, output a single integer $-1$.
Otherwise, output the smallest number of flights required to travel from cell $a$ to cell $b$ visiting all cells exactly once, followed by $n$ distinct integers $c_1, c_2, \ldots, c_n$ ($1 \le c_i \le n$) --- cell numbers in order of visiting, describing any valid path which needs the smallest possible number of flights. In particular, it must be true that $c_1 = a$ and $c_n = b$.
4 5 1 5 6 4 5 7 5 3 4 1 3
0 1 2 3 4 5 1 4 3 2 1 6 5 2 5 4 7 6 1 2 3 -1