P7321 "PMOI-4" Guess the Permutation

**This is an interactive IO problem.** **Please make sure before submitting to avoid crashing the judge.**

Xiao A has a **permutation** $a$ of length $n$, and he wants you to guess this permutation. You can only make the following two types of queries: - `! x y`: He will tell you the value of $a_x \bmod a_y$, where your query must satisfy $a_x\gt a_y$ and $x\ne y$; otherwise, he will get unhappy and directly judge the query as invalid, which will lead to `WA`. - `? l S p`: You need to give Xiao A a set $S$ of size $l$ and an integer $p$, where $S=\{x_1,x_2,x_3,\ldots,x_l\}$. For any $1\le i\le l$, $1\le x_i\le n$, and all $x_i$ are pairwise distinct. Also, it must satisfy $1\le p\le n$ and $1\le l\le n$. Xiao A will tell you all $x_k$ in this set such that $a_{x_k} \ge p$, returning in the following form: first an integer $L$, then $L$ integers, indicating that there are $L$ such $k$ (note that what is returned are the elements of the set $S$, not the indices within $S$). You can ask at most $m_1$ queries of type $1$ and $m_2$ queries of type $2$. In addition, for type $2$ queries, the sum of the sizes of the queried sets must not exceed $m_3$, in order to guess the sequence.

Input the permutation length $n$ and $m_1,m_2,m_3$ to start the interaction. During the interaction, you may make the two types of queries described above. Whether it is the first type of query or the second type of query, the interactive library will return an integer. After you are sure of the answer, output one line in the form `A a[1] a[2] ... a[n-1] a[n]` to stop the interaction. After you output a line, flush the buffer: - In C++, use `fflush(stdout)` or `cout.flush()`. - In Pascal, use `flush(output)`. - In Python, use `stdout.flush()`. - For other languages, please check the documentation yourself.

See "Interaction Method".

【Constraints】 **This problem uses bundled testdata.** | Subtask ID | Score | $n=$ | $m_1=$ | $m_2=$ | $m_3=$ | Special Constraints | | :-----------: | :-----------: | :-----------: | :-----------: | :-----------: | :-----------: | :-----------: | | $1$ | $10$ | $4$ | $4$ | $1$ | $4$ | None | | $2$ | $10$ | $5 \times 10^2$ | $5 \times 10^2$ | $5 \times 10^2$ | $2.5\times 10^5$ | None | | $3$ | $10$ | $2 \times 10^4$ | $2 \times 10^4$ | $2 \times 10^4$ | $3 \times 10^5$ | A | | $4$ | $20$ | $10^4$ | $10^4$ | $30$ | $3 \times 10^5$ | None | | $5$ | $20$ | $5 \times 10^4$ | $5 \times 10^4$ | $34$ | $4 \times 10^5$ | None | | $6$ | $25$ | $5 \times 10^4$ | $5 \times 10^4$ | $17$ | $1.5\times 10^5$ | None | | $7$ | $5$ | $5 \times 10^4$ | $5 \times 10^4$ | $15$ | $1.5\times 10^5$ | None | **A: The permutation $a$ is guaranteed to be constructed randomly.** 【Notes】 1. Making an invalid query, or continuing to query after the interactive library has output more than $m$ numbers, will directly lead to WA. 2. The top row in the Constraints table uses $=$, not $\le$. Translated by ChatGPT 5