The difference between the easy version and hard version is the maximum number of queries allowed. In this version, it is 33. There is a secret array (a) of length (2n+1), whose elements are integers from (1) to (n). Each value appears exactly twice, except for one value, which appears exactly three times. Your goal is to find the three positions of the value that appears three times. To do this, you may ask the following query at most 33 times: Choose an integer (k) and an array (s) of (k) distinct indices between (1) and (2n+1). You will receive the number of different values among (a_{s_1}, a_{s_2}, \ldots, a_{s_k}) that appear exactly once, or, in other words, the count of values that are not repeated. For example, if the values (a_{s_1}, \ldots, a_{s_k}) are (\{2, 1, 2, 3, 2, 3, 6, 7\}), the answer to the query will be 3, as 1, 6, 7 are the only values that appear exactly once. 3 appears 2 times and 2 appears 3 times, which is more than once, so they are not counted. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 500)). The description of the test cases follows. The first line of each test case contains a single integer (n) ((2 \le n \le 1000)). The array (a) is fixed for the test case and does not change during the interaction. In other words, the interactor is not adaptive . It is guaranteed that the sum of (n) over all test cases does not exceed (2 \cdot 10^4). For each test case, first read a single integer (n). You may ask up to (33) queries in each test case. To ask a query, print a line in the format: ? (k) (s_1) (s_2) (\ldots) (s_k) ((s_i \neq s_j) for (i \neq j), (1 \le s_i \le 2 \cdot n + 1)) As a response to the query, you will receive the number of different values among (a_{s_1}, a_{s_2}, \ldots, a_{s_k}) that appear exactly once, or in other words, the count of