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 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 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 integers ti and ri (<image>, 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.
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

public class Round344Div2C {

	public static class Pair implements Comparable<Pair>{
		int value;
		int id;
		int type;
		public Pair(int value,int id,int type) {
			this.id=id;
			this.value=value;
			this.type=type;
		}
		
		public int compareTo(Pair x) {
			if(this.value==x.value) {
				return x.id-this.id;
			}
			return x.value-this.value;
			
		}
	}
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		out=new PrintWriter (new BufferedOutputStream(System.out));
		FastReader s=new FastReader();
		int n=s.nextInt();
		int m=s.nextInt();
		int[] arr=new int[n];
		PriorityQueue<Integer> min=new PriorityQueue<Integer>();
		PriorityQueue<Integer> max=new PriorityQueue<Integer>();
		for(int i=0;i<n;i++) {
			arr[i]=s.nextInt();
		}
		Pair[] commands=new Pair[m];
		int maxpointer=-1;
		for(int i=0;i<m;i++) {
			int t=s.nextInt();
			int r=s.nextInt()-1;
			commands[i]=new Pair(r,i,t);
			if(r>maxpointer) {
				maxpointer=r;
			}
		}
		Arrays.sort(commands);
		for(int i=0;i<=maxpointer;i++) {
			max.add(-arr[i]);
			min.add(arr[i]);
		}
		ArrayList<Pair> FinalCommands=new ArrayList<Pair>();
		FinalCommands.add(commands[0]);
		for(int i=1;i<m;i++) {
			int lastindex=FinalCommands.get(FinalCommands.size()-1).id;
			int currentindex=commands[i].id;
			if(lastindex>currentindex)continue;
			FinalCommands.add(commands[i]);
		}
		ArrayList<Integer> ans=new ArrayList<Integer>();
		for(int i=arr.length-1;i>maxpointer;i--) {
			ans.add(arr[i]);
		}
		int pointer=0;
		int type=1;//1 ascending (ie max priority queue) 2 is descending that is min priority queue
		for(int i=maxpointer;i>=0;i--) {
			if(pointer<FinalCommands.size() && FinalCommands.get(pointer).value==i) {
				type=FinalCommands.get(pointer).type;
				pointer++;
			}
			if(type==1) {
				ans.add(-max.remove());
			}else {
				ans.add(min.remove());
			}
		}
		for(int i=ans.size()-1;i>=0;i--) {
			out.print(ans.get(i)+" ");
		}
		out.close();
	}

	public static PrintWriter out;
	
	public static class FastReader {
		BufferedReader br;
		StringTokenizer st;
		//it reads the data about the specified point and divide the data about it ,it is quite fast
		//than using direct 

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
			//InputStream reads the data and decodes in character stream
			//It acts as bridge between byte stream and character stream
		}

		String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (Exception e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());//converts string to integer
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (Exception e) {
				e.printStackTrace();
			}
			return str;
		}
	}
	
}
