B'Bob has a simple undirected connected graph (without self-loops and multiple edges). He wants to learn whether his graph is bipartite (that is, you can paint all vertices of the graph into two colors so that there is no edge connecting two vertices of the same color) or not. As he is not very good at programming, he asked Alice for help. He does not want to disclose his graph to Alice, but he agreed that Alice can ask him some questions about the graph. The only question that Alice can ask is the following: she sends s -- a subset of vertices of the original graph. Bob answers with the number of edges that have both endpoints in s . Since he doesn 't want Alice to learn too much about the graph, he allows her to ask no more than 20000 questions. Furthermore, he suspects that Alice might introduce false messages to their communication channel, so when Alice finally tells him whether the graph is bipartite or not, she also needs to provide a proof -- either the partitions themselves or a cycle of odd length. Your task is to help Alice to construct the queries, find whether the graph is bipartite. The first line contains a single integer n ( 1 <= q n <= q 600 ) -- the number of vertices in Bob 's graph. First, read an integer n ( 1 <= q n <= q 600 ) -- the number of vertices in Bob 's graph. To make a query, print two lines. First of which should be in the format "? k" ( 1 <= q k <= q n ), where k is the size of the set to be queried. The second line should contain k space separated distinct integers s_1, s_2, ... , s_k ( 1 <= q s_i <= q n ) -- the vertices of the queried set. After each query read a single integer m ( 0 <= q m <= q frac{n(n-1)}{2} ) -- the number of edges between the vertices of the set {s_i } . You are not allowed to ask more than 20000 queries. If m = -1 , it means that you asked more queries than allowed, or asked an invalid query. Your pro'...