Given a sequence $1,2,3,\cdots,N$, you need to calculate all the possible sub-sequences that the sum of the sub-sequence is M.
输入格式
Multiple test cases, please process until $N=M=0$.
Each test case occupies one line, contains two integers $N,M\ (1\le N,M\le 10^9)$.
输出格式
For each test case, print all the possible sub-sequence that its sum is $M$.
The format is show in the sample below.
Print a blank line after each test case.