This is an interactive problem. For a permutation(^{\text{∗}}) (g = (g_1, g_2, \ldots, g_m)), define its reverse as (\operatorname{rev}(g) = (g_m, g_{m-1}, \ldots, g_1)). There is a hidden permutation (p) of size (n). Your task is to find the lexicographically smallest(^{\text{†}}) permutation (q) of size (n) such that (q > p) and (\operatorname{rev}(q) > \operatorname{rev}(p)). However, you do not need to output (q) itself. Instead, you must output a permutation (r) of size (n) such that (q_i = p_{r_i}) for all (1 \le i \le n). If no such (q) exists, report that instead. To find the answer, you can ask at most (3n) queries of the form (? i \; j) ((1 \le i, j \le n)). The interactor responds with (1) if (p_i < p_j) and (0) otherwise. The interactor is not adaptive , which means that the permutation (p) is fixed throughout the interaction. (^{\text{∗}})A permutation of length (n) is an array consisting of (n) distinct integers from (1) to (n) in arbitrary order. For example, (2,3,1,5,4) is a permutation, but (1,2,2) is not a permutation ((2) appears twice in the array), and (1,3,4) is also not a permutation ((n=3) but there is (4) in the array). (^{\text{†}}) An array (x) is lexicographically smaller than array (y) (so (x < y)) if and only if one of the following holds: (x) is a prefix of (y), but (x \ne y); or Let (i) be the first position where (x_i \neq y_i) (if it exists), then (x_i < y_i). Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 1000)). The description of the test cases follows. The first line of each test case contains a single integer (n) ((2 \le n \le 2 \cdot 10^4)) — the size of the hidden permutation (p). The hidden permutation (p) is fixed for the test case and does no