B'This is an interactive problem. Kostyanych has chosen a complete undirected graph ^{ dagger} with n vertices, and then removed exactly (n - 2) edges from it. You can ask queries of the following type: Find a Hamiltonian path ^{ ddagger} in the original graph in at most n queries. It can be proven that under these constraints, a Hamiltonian path always exists. ^{ dagger} A complete undirected graph is a graph in which there is exactly one undirected edge between any pair of distinct vertices. Thus, a complete undirected graph with n vertices contains frac{n(n-1)}{2} edges. ^{ ddagger} A Hamiltonian path in a graph is a path that passes through each vertex exactly once. Each test consists of multiple test cases. The first line contains a single integer t ( 1 <= t <= 1000 ) -- the number of test cases. The description of the test cases follows. The only line of each test case contains a single integer n ( 2 <= n <= 10^5 ) -- the number of vertices in the graph. It is guaranteed that the sum of n over all test cases does not exceed 10^5 . Interaction for each test case begins with reading the integer n . Then you can make no more than n queries. To make a query, output a line in the format "? d " (without quotes) ( 0 <= d <= n - 1 ). After each query, read two integers -- the answer to your query. When you are ready to report the answer, output a line in the format "! v_1 v_2 ldots v_n " (without quotes) -- the vertices in the order of their occurrence in the Hamiltonian path. Outputting the answer does not count as one of the n queries. After solving one test case, the program should immediately move on to the next one. After solving all test cases, the program should be terminated immediately. If your program makes more than n queries for one test case or makes an incorrect query, then the response to the query will be -1$$'...