13:I[87,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"Header"] 14:I[1742,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"ProblemView"] 15:T6e2,

Given an integer $$$n$$$. Construct a permutation $$$p_1, p_2, \ldots, p_n$$$ of length $$$n$$$ that satisfies the following property:

For $$$1 \le i \le n$$$, define $$$c_i = \lceil \frac{p_1+p_2+\ldots +p_i}{i} \rceil$$$, then among $$$c_1,c_2,\ldots,c_n$$$ there must be at least $$$\lfloor \frac{n}{3} \rfloor - 1$$$ prime numbers.

Input

The first line contains an integer $$$t$$$ ($$$1 \le t \le 10$$$) — the number of test cases. The description of the test cases follows.

In a single line of each test case, there is a single integer $$$n$$$ ($$$2 \le n \le 10^5)$$$ — the size of the permutation.

Output

For each test case, output the permutation $$$p_1,p_2,\ldots,p_n$$$ of length $$$n$$$ that satisfies the condition. It is guaranteed that such a permutation always exists.

Note

In the first test case, $$$c_1 = \lceil \frac{

Simple Permutation

Examples