This is an interactive problem. There is a hidden undirected tree consisting of (n) vertices. To find this tree, you may ask queries of the following form: Pick a sequence of distinct vertices (a_1, a_2, \ldots, a_k), where (k \ge 1). The interactor will process your sequence and return a subset of these vertices, denoted by (S). The set (S) is generated by the following process: Initially, (S) is an empty set. The interactor processes the vertices in the exact order they appear in your sequence, from (a_1) to (a_k). For each (a_i), if (a_i) does not share an edge with any vertex that is currently in (S), then (a_i) is added to (S). Otherwise, (a_i) is ignored. After processing all (k) vertices, the interactor returns the final set (S) to you. (S) is represented by a binary string (s) of length (k), where (s_i=1) if and only if (a_i \in S). Your task is to find all (n-1) edges of the hidden tree. To make the problem harder, the sum of (k) over all queries must not exceed (30 \cdot n). Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 100)). The description of the test cases follows. The first line of each test case contains an integer (n) ((2 \le n \le 10^3)), representing the number of vertices in the hidden tree. It is guaranteed that the sum of (n) over all test cases does not exceed (10^3). To make a query, output a line in the following format: (\mathtt{?}\;k\;a_1\;a_2\;\ldots\;a_k) ((1 \le k \le n), (1 \le a_i \le n), (a_i \ne a_j) for all (1 \le i \lt j \le k)) As a response to the query, you will receive a binary string of length (k), representing (S). To report the answer, first output (\mathtt{!}) on a single line. Then, output (n-1) lines, where the (i)-th line contains two integers (u_i) and (v_i), representing an