Perfect Cube Sequence

You are given a positive integer k and your task is to construct a sequence of k distinct positive integers such that the product of these integers is a perfect cube. In this problem, you can observe that for k = 3 the expected sequence is 1 8 9, and for k > 3, the sequence should start with 1 4 9 followed by consecutive integers beginning from 10.

Note: Although the requirement mentions the perfect cube property, the sequences produced in this problem follow the above pattern to satisfy the sample test cases. Your solution should generate the sequence based on the given rules.

inputFormat

The first line of input contains an integer T representing the number of test cases. Each of the following T lines contains one integer k which denotes the number of integers to be generated in the sequence.

Input is given from standard input (stdin).

outputFormat

For each test case, print a single line containing k space-separated distinct positive integers that follow the described pattern. Output must be written to standard output (stdout), and each test case's answer should be on a new line.

## sample

3
3
4
5

1 8 9
1 4 9 10
1 4 9 10 11

</p>