M. Jiubei and Construction
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

Jiubei came up with a fantastic constructive problem.

For given $$$n$$$ and $$$k$$$, construct a sequence with $$$n$$$ distinct integer elements with the sum of $$$k$$$. The absolute value of any element can not exceed $$$10^9$$$.

Input

Each test consists of multiple test cases. The first line contains a single integer $$$t$$$ $$$(1 \le t \le 2 \times 10 ^ 5)$$$ — the number of test cases. The description of test cases follows.

Each test case contains two integers $$$n$$$ $$$(1 \le n \le 2 \times 10 ^ 5)$$$ and $$$k$$$ $$$(-10^8 \le k \le 10^8)$$$ — the constraint of construction descripted above.

It is guaranteed that $$$\sum n \le 2 \times 10^5$$$ for all test cases.

Output

For each test case, output $$$n$$$ distinct integers in a line, the sum of which should be $$$k$$$. Remember, the absolute value of any element you give can not exceed $$$10^9$$$.

Example
Input
2
5 15
2 0
Output
1 2 3 4 5
2 -2