Given an integer
, construct an array of length such that:
- for all ;
- There exists a subsequence of length greater than such that the gcd of all elements of the subsequence is , for all .
More formally, for all , there exists a subsequence of array such that the length of the subsequence is and .
It can be proven that it is always possible to construct such under given constraints. If there exist multiple such arrays, print any.
Input Format
- The first line of input contains a single integer , denoting the number of test cases. The description of test cases follow.
- The only line of each test case contains an integer - the length of the array to be constructed.
Output Format
For each test case, output a single line containing space-separated integers, denoting the elements of the array . The of these integers is the element of the array .
If there exist multiple such arrays, print any.
Constraints
- Sum of over all test cases does not exceed .
Sample Input 1
2
3
4
Sample Output 1
2 3 6
4 24 10 15
Explanation
Test case : A possible array satisfying all the conditions is [2, 3, 6]:
- For : Choose . Thus, .
- For : Choose . Thus, .
- For : Choose . Thus, .
Test case : A possible array satisfying all the conditions is [4, 24, 10, 15]:
- For : Choose . Thus, .
- For : Choose . Thus, .
- For : Choose . Thus, .
- For : Choose . Thus,
No comments:
Post a Comment