A10366 | Report

Each month Blake gets the report containing main economic indicators of the company "Blake Technologies". There are $n$ commodities produced by the company. For each of them there is exactly one integer in the final report, that denotes corresponding revenue. Before the report gets to Blake, it passes through the hands of $m$ managers. Each of them may reorder the elements in some order. Namely, the $i$ -th manager either sorts first $r_{i}$ numbers in non-descending or non-ascending order and then passes the report to the manager $i+1$ , or directly to Blake (if this manager has number $i=m$ ).

Employees of the "Blake Technologies" are preparing the report right now. You know the initial sequence $a_{i}$ of length $n$ and the description of each manager, that is value $r_{i}$ and his favourite order. You are asked to speed up the process and determine how the final report will look like.

The first line of the input contains two integers $n$ and $m$ ( $1<=n,m<=200000$ ) — the number of commodities in the report and the number of managers, respectively.

The second line contains $n$ integers $a_{i}$ ( $|a_{i}|<=10^{9}$ ) — the initial report before it gets to the first manager.

Then follow $m$ lines with the descriptions of the operations managers are going to perform. The $i$ -th of these lines contains two integers $t_{i}$ and $r_{i}$ (, $1<=r_{i}<=n$ ), meaning that the $i$ -th manager sorts the first $r_{i}$ numbers either in the non-descending (if $t_{i}=1$ ) or non-ascending (if $t_{i}=2$ ) order.

Print $n$ integers — the final report, which will be passed to Blake by manager number $m$ .