Vesemir and Riddle

0

0 votes
Easy
Problem

Vesemir has given Geralt a riddle. In this riddle, he needs to find n consecutive numbers having values between 109 and 109 both inclusive, such that their sum is equal to k. Since this riddle is a cakewalk for Geralt and you are his apprentice, he has asked you to solve this riddle so that he can focus on improving his combat techniques.

Input Format--

First line contains t, number of test cases.

Each of the following t lines contains two integers, n and k.

Output Format--

For each test case, output the calculated n integers in increasing order separated by spaces. If it isn't possible for n consecutive numbers to have sum equal to k then print "Impossible"(without quotes).

Constraints--

1t100

1n104

109k109

Sample Input
5
2 1
3 6
4 18
4 2
3 5
Sample Output
0 1
1 2 3
3 4 5 6
-1 0 1 2
Impossible
Time Limit: 1
Memory Limit: 256
Source Limit:
Explanation

For the first case, (0 + 1) = 1.

For the second case, (1 + 2 + 3) = 6.

For the third case, (3 + 4 + 5 + 6) = 18.

For the fourth case, (-1 + 0 + 1 + 2) = 2.

For the fifth case, it isn't possible for 3 consecutive numbers to have sum equal to 5.

Editor Image

?