B'You are given a positive integer n . In this problem, the operatorname{MEX} of a collection of integers c_1,c_2, ... ,c_k is defined as the smallest positive integer x which does not occur in the collection c . The primality of an array a_1, ... ,a_n is defined as the number of pairs (l,r) such that 1 <= l <= r <= n and operatorname{MEX}(a_l, ... ,a_r) is a prime number. Find any permutation of 1,2, ... ,n with the maximum possible primality among all permutations of 1,2, ... ,n . Note: Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^4 ). The description of the test cases follows. The only line of each test case contains a single integer n ( 1 <= n <= 2 cdot 10^5 ). It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case, output n integers: a permutation of 1,2, ... ,n that achieves the maximum possible primality. If there are multiple solutions, print any of them. In the first test case, there are 3 pairs (l,r) with 1 <= l <= r <= 2 , out of which 2 have a prime operatorname{MEX}(a_l, ... ,a_r) : In the second test case, operatorname{MEX}(1) = 2 is prime, so the primality is 1 . In the third test case, the maximum possible primality is 8 . '...