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 ri numbers in non-descending or non-ascending order and then passes the report to the manageri + 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 ai of length n and the description of each manager, that is value ri 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 ai (|ai| ≤ 109) — 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 integersti and ri (, 1 ≤ ri ≤ n), meaning that the i-th manager sorts the first ri numbers either in the non-descending (if ti = 1) or non-ascending (if ti = 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个操作。每一个操作给出的是前x个数按照升序还是降序排列。问最终结果。

从前往后 过滤出一个逐渐减小的操作区间。然后不断过滤出最大值与最小值。

代码：

#pragma warning(disable:4996)
#include <iostream>
#include <functional>
#include <algorithm>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
using namespace std;
typedef long long ll;

#define INF 0x3fffffffffffffff

const ll mod = 1e9 + 7;
const int maxn = 200005;

int n, m;
int val[maxn], sor_val[maxn], t[maxn], r[maxn], ans[maxn];

void solve()
{
	int i, j, k;
	scanf("%d%d", &n, &m);

	for (i = 1; i <= n; i++)
	{
		scanf("%d", &val[i]);
		sor_val[i] = val[i];
	}

	int num = 0;
	for (i = 1; i <= m; i++)
	{
		scanf("%d%d", &t[i], &r[i]);
		while (num > 0 && r[i] >= r[num - 1])
		{
			num--;
		}
		t[num] = t[i], r[num] = r[i], num++;
	}

	for (j = r[0] + 1; j <= n; j++)
	{
		ans[j] = val[j];
	}
	sort(sor_val + 1, sor_val + 1 + r[0]);
	
	int st = 1, fin = r[0];
	r[num] = 0;
	for (i = 0; i < num; i++)
	{
		for (j = r[i]; j > r[i + 1]; j--)
		{
			ans[j] = t[i] == 1 ? sor_val[fin--] : sor_val[st++];
		}
	}
	for (i = 1; i <= n; i++)
	{
		printf("%d ", ans[i]);
	}
}

int main()
{
#ifndef ONLINE_JUDGE  
	freopen("i.txt", "r", stdin);
	freopen("o.txt", "w", stdout);
#endif 

	solve();

	//system("pause");
	return 0;
}