Strange Sequences
Time Limit: 1.0 s
Memory Limit: 256.0 MB
Description
You have given a Positive integer N and you have to print an array of N integers (\(A_1\), \(A_2\),... ,\(A_N\)) with following condition.
- 1 ≤ \(A_i\) ≤ \(10^5\)
- \(A_i\) ≠ \(A_j\) and gcd( \(A_i\) , \(A_j\)) > 1 for i ≠ j
- gcd(\(A_1\), \(A_2\),... ,\(A_N\)) = 1
There will be several sequences, but you should only print the lexicographically minimal one.
Input
First Line T, Number of test cases.
In each test case, you have given an integer number N.
1 ≤ T ≤ 10
3 ≤ N ≤ 20000
Output
Print the seqence of A which satisfying the conditions.
Sample
Input | Output |
---|---|
|
|
Information
- ID
- 1070
- Difficulty
- 9
- Category
- Number_Theory Click to Show
- Tags
- # Submissions
- 70
- Accepted
- 4
- Accepted Ratio
- 6%
- Uploaded By
Related
In following contests: