Guess the Permutation

You are given a hidden permutation \(a\) of \(n\) integers. In the original interactive version of the problem, you were allowed to ask two types of queries:

• ! x y which returns \(a_x \bmod a_y\) if \(a_x > a_y\) and \(x \neq y\); otherwise the query is invalid.
• ? l S p in which you provide a set \(S=\{x_1,x_2,\ldots,x_l\}\) (with all \(x_i\) distinct and \(1\le x_i\le n\)) and an integer \(p\) (with \(1\le p\le n\)). The response is all elements from the set \(S\) for which \(a_{x_i} \ge p\).

You are given the additional query limits: at most \(m_1\) queries of type 1, at most \(m_2\) queries of type 2, and the total size of sets used in type 2 queries should not exceed \(m_3\). However, in this version the problem is transformed into a static one. Instead of interacting with the judge, the hidden permutation is provided in the input.

Your task is simply to output the permutation as given. This is a simulation of the interactive problem in a static format.

inputFormat

The first line of input contains four integers \(n\), \(m_1\), \(m_2\), and \(m_3\) where \(n\) is the length of the permutation \(a\). The next line contains \(n\) space-separated integers representing the permutation \(a = [a_1, a_2, \ldots, a_n]\), which is a rearrangement of the numbers from 1 to \(n\).

Note: The values for \(m_1\), \(m_2\), and \(m_3\) are provided for consistency with the original interactive problem and do not affect the output.

outputFormat

Output the permutation \(a\) in one line, with the numbers separated by a single space.

sample

1 1 1 1
1

1