B'This is an interactive problem. There is a hidden permutation p_1, p_2, ... , p_n . Consider an undirected graph with n nodes only with no edges. You can make two types of queries: Note that you can make both types of queries in any order. Within 2n queries (including type 1 and type 2 ), guess two possible permutations, at least one of which is p_1, p_2, ... , p_n . You get accepted if at least one of the permutations is correct. You are allowed to guess the same permutation twice. 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). Each test contains multiple test cases. The first line contains a single integer t ( 1 <= t <= 100 ) -- the number of test cases. The first line of each test case contains a single integer n ( 2 <= n <= 10^3 ) -- the length of the permutation. It is guaranteed that the sum of n over all test cases does not exceed 10^3 . The interaction for each test case begins by reading the integer n . Then, make at most 2n queries: At any point of the interaction, if you want to guess two permutations, output "! p_{1,1} p_{1,2} ... p_{1,n} p_{2,1} p_{2,2} ... p_{2,n} ". Note that you should output the two permutations on the same line, and no exclamation mark is needed to separate the two permutations. After doing that read 1 or -2 . If you read 1 your answer was correct, otherwise it was incorrect and your program must terminate immediately to receive a Wrong Answer verdict. After that, move on to the next test case, or terminate the program if there are none. Note that reporting the answer does not co'...