codeforces 631C Report

C. Report

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

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⁹) — 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.

题意：给n个数，m个操作，每个操作op，len。op == 1时，从第一个数开始至后面len个数进行由小到大排序，op == 2 ，从第一个数开始至后面len个数进行由小到大排序。

暴力sort超时，细想是贪心。不管前面进行的什么操作，如果后一个操作的长度比前一个长，那么前一个操作是无效的，所以有效的操作是从最长操作长度那一个地方开始的。而且最长长度后面的数不会改变。

后面只能进行比当前操作长度短的一些的操作，所以次长度到当前长度中间一截数据就不会改变，根据当前的操作筛选数据就行了（数据是原数组中由第一个开始到需改变最长度的一段数字排序的数据）。

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
const int maxn = 200000+10;

int n,m;
int a[maxn];   ///存原数组
int ans[maxn]; ///存最后答案
int len[maxn]; ///进行操作的每个点需要改变的长度
int op[maxn];  ///进行操作的每个点进行1或者2的操作
int num[maxn]; ///进行操作的每个点的编号

int main()
{
    scanf("%d %d",&n,&m);
    for(int i = 1; i <= n; i++)
    {
        scanf("%d",&a[i]);
        ans[i] = a[i];
    }
    for(int i = 1; i <= m; i++)
    {
        scanf("%d%d",&op[i],&len[i]);
        num[i] = i;
    }
    num[m+1] = m+1;
    for(int i = m; i > 1; i--)   ///编号和长度进行修改
    {
        if(len[i-1] < len[i])
        {
            len[i-1] = len[i];
            num[i-1] = num[i];
        }
    }
    len[m+1] = 0;
    int st = 1;
    int en = len[1];   ///需要操作的最远的一个点
    int t = num[1];    ///最长的需要操作长度的下标
    int id = len[1];   ///从最长需要改变的一个点开始记录
    sort(a+1,a+1+en);  ///只能对需要操作的最长长度的点进行排序
    while(t <= m)
    {
        int cnt = len[t]-len[t+1];
        while(cnt)
        {
            if(op[t] == 1)
            {
                ans[id--] = a[en--];
                cnt--;
            }
            else
            {
                ans[id--] = a[st++];
                cnt--;
            }
        }
        t = num[t+1];
    }
    for(int i = 1;i <= n;i++)
    {
        printf("%d ",ans[i]);
    }
    return 0;
}