You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

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. 1 ≤ \(A_i\) ≤ \(10^5\)
2. \(A_i\) ≠ \(A_j\) and gcd( \(A_i\) , \(A_j\)) > 1 for i ≠ j
3. 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

1
3

6 10 15