Ceiling Sum — Eolymp

Input

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

The only line of each test case contains two integers $n, k$ $(1 \leq n \leq 1 0^{6}; 1 \leq k \leq 1 0^{12})$ (1 \le n \le 10^6; 1\le k \le 10^{12}) — the length of $a$ and desired sum.

It's always guaranteed that an array exists under the set of test

It's guaranteed that $\sum n \leq 1 0^{6}$ \sum n \le 10^6 overall tests.

Output

Print the array $a$ : $a_{1}, a_{2}, \dots, a_{n}$ a_1,a_2,\ldots,a_n where $(1 \leq a_{1}, a_{2}, \dots, a_{n} \leq 1 0^{9})$ (1 \le a_1,a_2,\ldots,a_n \le 10^9).

Examples

Example 1

Loading

Scoring

Subtask $1$ ( $20$ points) : $(\frac{k}{n} \leq 10)$ (\frac{k}{n} \leq 10).
Subtask $2$ ( $30$ points) : A solution with $(1 \leq a_{i} \leq 2)$ (1 \le a_i \le 2) exists.
Subtask $3$ ( $250$ points) : No additional constraints.