Consecutive Sums 
Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB 
Total submit users: 42, Accepted users: 38 
Problem 10031 :
No special judgement

Problem description 
A positive integer can be obtained by adding n (n>=2) consecutive positive integers, take 15 as an example, 15 can be decomposed to
1+2+3+4+5 or
4+5+6 or
7+8
and 10 can only be decomposed to 1+2+3+4 .
As an excellent programmer in Hunan University, you are request to write a program that will compute all possible cases and output them all.

Input 
The input contains several test cases. The first line is the test case number N. For each test case, there is only one positive integer M(M<=65535) in a single line.

Output 
For each test case, you should output all possible answers containing the numbers that add up to M. You should output them in the order like this: if one answer has more numbers the other, it should be first output. So for the input 15, you should output
1 2 3 4 5
4 5 6
7 8
If there is no answer, just output NONE in a line.

Sample Input 
3
15
10
16

Sample Output 
1 2 3 4 5
4 5 6
7 8
1 2 3 4
NONE

Problem Source 
HNU Contest

Submit
Discuss
Judge Status
Problems
Ranklist
