Secret Tree

**This is an interactive task** You are given a positive integer $N$. There is a tree with $N$ nodes numbered from $1$ to $N$ which is hidden from you. You can ask queries of the following format: $?$ $k$ $a_1$ $a_2$ $a_3$ $\dots a_k$ where: - $3 \leq k \leq N$ - $1 \leq a_i \leq N$ - $a_i \neq a_j$ for all $1 \le i \lt j \le k$ The judge will return $1$ if {$a_1, a_2, a_3, \dots, a_k$