This is an interactive problem. There is a secret sequence (a_1, a_2, \ldots, a_{2n-1},a_{2n}), which contains each integer from (1) to (n) exactly twice . Your task is to guess the sequence by using queries of the following type: "? (k\;j_1\;j_2\;\ldots\;j_k)" — select the integer (k) ((1 \le k \le 2n)) and (k) distinct indices (j_1, j_2, \ldots, j_k) ((1 \le j_1 , j_2 , \ldots , j_k \le 2n)). In response to the query, the jury will return (\text{MAD}(a_{j_1}, a_{j_2}, \ldots, a_{j_k})). We define the (\operatorname{MAD}) (Maximum Appearing Duplicate) of an integer sequence as the largest integer that appears at least twice. Specifically, if there is no number that appears at least twice, the (\operatorname{MAD}) value is (0). Some examples are as follows: (\operatorname{MAD}(1, 2, 1) = 1); (\operatorname{MAD}(2, 2, 3, 3) = 3); (\operatorname{MAD}(1, 2, 3, 4) = 0). Please identify the secret sequence using at most (3n) queries . Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 3000)). The description of the test cases follows. The first line of each test case contains one integer (n) ((2 \le n \le 300)). It is guaranteed that the sum of (n^2) over all test cases does not exceed (10^5). After you read this line of input, the interaction begins with your first query. To make a query, output a line (without quotes) in the following format: " ? (k\;j_1\;j_2\;\ldots\;j_k)" ((1 \le k \le 2n), (1 \le j_1 , j_2 , \ldots , j_k \le 2n)) Here, the indices (j_1 , j_2 , \ldots , j_k) which you selected must be pairwise distinct . Then, after each query, read a single integer — the answer to your query. You can make at most (3n) queries of this type. If your program has found the sequence (a), print the line (without quotes) in the following format: " ! $$$a_1\;a_2\;\ldots\;a_{2n-1}\;a_{2n}