Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. Report

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputEach 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.

Input

The first line of the input contains two integers *n* and *m* (1 ≤ *n*, *m* ≤ 200 000) — 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.

Output

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

Examples

Input

3 1

1 2 3

2 2

Output

2 1 3

Input

4 2

1 2 4 3

2 3

1 2

Output

2 4 1 3

Note

In the first sample, the initial report looked like: 1 2 3. After the first manager the first two numbers were transposed: 2 1 3. The report got to Blake in this form.

In the second sample the original report was like this: 1 2 4 3. After the first manager the report changed to: 4 2 1 3. After the second manager the report changed to: 2 4 1 3. This report was handed over to Blake.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/20/2019 18:07:53 (h3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|