You are required to put n straight lines on a plane, guaranteeing no three lines share a common point and no lines are coincident. They will form some intersections, please output all possible numbers of intersections.
输入解释
The first line, an integer T(1 ≤ T ≤ 5) - the number of test cases.
Following T lines, an positive integer n(1 ≤ n ≤ 700) - the number of lines.
输出解释
Several lines, each line several numbers separated by a blank space - all possible numbers of intersections.