Given a sequence 1,2,3,......N, your job is to calculate all the possible sub-sequences that the sum of the sub-sequence is M.
输入解释
Input contains multiple test cases. each case contains two integers N, M( 1 <= N, M <= 1000000000).input ends with N = M = 0.
输出解释
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.