A. Submission Bait II
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given an integer $$$n$$$, and you need to construct an array $$$a$$$ of size $$$n$$$ satisfying:

  • $$$1 \le a_i \le 2n$$$ for all $$$1 \le i \le n$$$.
  • There are not two distinct indices $$$i$$$ and $$$j$$$ $$$(1 \le i,j \le n,$$$ $$$i \neq j)$$$ such that $$$a_i$$$ can be divided by $$$a_j$$$.
Input

The first line contains a single integer $$$t$$$ ($$$1 \le t\le 10^3$$$), the number of test cases.

The only line of each test case contains an integer $$$n$$$ ($$$1\le n\le 10^5$$$).

It is guaranteed that the sum of $$$n$$$ over all test cases will not exceed $$$10^5$$$.

Output

For each test case, output $$$n$$$ integers  — the array you construct.

If there are multiple solutions, print any of them.

Example
Input
3
2
3
4
Output
2 3
5 3 2
2 3 5 7