CF1409C.Yet Another Array Restoration

We have a secret array. You don't know this array and you have to restore it. However, you know some facts about this array:

• The array consists of $n$ distinct positive (greater than $0$) integers.
• The array contains two elements $x$ and $y$ (these elements are known for you) such that $x \lt y$.
• If you sort the array in increasing order (such that $a_1 \lt a_2 \lt \ldots \lt a_n$), differences between all adjacent (consecutive) elements are equal (i.e. $a_2 - a_1 = a_3 - a_2 = \ldots = a_n - a_{n-1})$.

It can be proven that such an array always exists under the constraints given below.

Among all possible arrays that satisfy the given conditions, we ask you to restore one which has the minimum possible maximum element. In other words, you have to minimize $\max(a_1, a_2, \dots, a_n)$.

You have to answer $t$ independent test cases.

我们有一个秘密数组。你并不知道这个数组，但你需要将其还原。然而，你已知关于该数组的一些事实：

• 该数组由 $n$ 个互不相同的正整数（即大于 $0$ 的整数）构成；
• 该数组包含两个已知元素 $x$ 和 $y$（满足 $x \lt y$）；
• 若将该数组按升序排序（即 $a_1 \lt a_2 \lt \ldots \lt a_n$），则所有相邻（连续）元素之间的差值均相等（即 $a_2 - a_1 = a_3 - a_2 = \ldots = a_n - a_{n-1}$）。

在以下约束条件下，可以证明满足上述条件的数组一定存在。

在所有满足给定条件的可能数组中，要求你还原出一个最大元素尽可能小的数组。换言之，你需要最小化 $\max(a_1, a_2, \dots, a_n)$。

你需要回答 $t$ 个相互独立的测试用例。

The first line of the input contains one integer $t$ ($1 \le t \le 100$) — the number of test cases. Then $t$ test cases follow.

The only line of the test case contains three integers $n$, $x$ and $y$ ($2 \le n \le 50$; $1 \le x \lt y \le 50$) — the length of the array and two elements that are present in the array, respectively.

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

每个测试用例仅一行，包含三个整数 $n$、$x$ 和 $y$（$2 \le n \le 50$；$1 \le x \lt y \le 50$），分别表示数组的长度以及数组中包含的两个元素。

For each test case, print the answer: $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^9$), where $a_i$ is the $i$-th element of the required array. If there are several answers, you can print any (it also means that the order of elements doesn't matter).

It can be proven that such an array always exists under the given constraints.

对于每个测试用例，输出答案：$n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le 10^9$），其中 $a_i$ 是所求数组的第 $i$ 个元素。若存在多个答案，可输出任意一个（这也意味着元素的顺序无关紧要）。

在给定约束条件下，可以证明这样的数组一定存在。