Min Sum Construction

Input

The first line contains a single integer $t$ ( $1 \leq t \leq 1 0^{4}$ 1 \le t \le 10^4) — the number of test cases.

Each test case consists of one line containing four integers $n, a, b, c$ n,\ a,\ b,\ c ( $1 \leq n \leq 1 0^{5}$ 1 \le n \le 10^5, $1 \leq a, c \leq 1 0^{10}$ 1 \le a,\ c \le 10^{10}, $1 \leq b \leq n$ 1 \le b \le n).

It is guaranteed that $\sum n \leq 1 0^{5}$ \sum n \le 10^5 over all test cases.

Output

For each test case, output any valid array $A$ .

Note that it must hold that $1 \leq A_{i} \leq n$ 1 \le A_i \le n for all $i$ .

Examples

Example 1

Loading

Note

In the first test case, $A = [2, 3, 3]$ A = [2, 3, 3]:

The sum is $\sum_{i = 1}^{n} A_{i} = 2 + 3 + 3 = 8$ \sum_{i=1}^n A_i = 2+3+3 = 8, which matches $a = 8$ a = 8.

$\sum_{i = 1}^{n} min (A_{i}, b) = 2 + 3 + 3 = 8$ \sum_{i=1}^n \min(A_i,\ b) = 2+3+3 = 8, which matches $c = 8$ c = 8.

Thus, the array is valid.

Scoring

Subtask $1$ ( $10$ points): $n = 3$ n = 3
Subtask $2$ ( $20$ points): $a = c$ a = c
Subtask $3$ ( $30$ points): $1 \leq \sum n \leq 100$ 1 \le \sum n \le 100
Subtask $4$ ( $40$ points): $1 \leq \sum n \leq 1 0^{4}$ 1 \le \sum n \le 10^4
Subtask $5$ ( $200$ points): No additional constraints