Interactive Array Guessing

문제

This is an interactive problem.

Jury has prepared n non-empty integer arrays a₁, a₂, . . . , a_n. Each array consists of at most 10 positive integers not exceeding 1000. The elements of each array are pairwise distinct.

You can make queries of the following kind: choose several indices q₁, q₂, . . . , q_m, where 1 ≤ m ≤ n and 1 ≤ q_i ≤ n. These indices do not have to be distinct. The testing system tells you the contents of arrays a_q1, a_q2, . . . , a_qm in the same order. However, these contents are concatenated without any delimeters.

Your task is to find the contents of all n arrays.