There is a country with n citizens. The i-th of them initially has a_{i} money. The government strictly controls the wealth of its citizens. Whenever a citizen makes a purchase or earns some money, they must send a receipt to the social services mentioning the amount of money they currently have.

Sometimes the government makes payouts to the poor: all citizens who have strictly less money than x are paid accordingly so that after the payout they have exactly x money. In this case the citizens don't send a receipt.

You know the initial wealth of every citizen and the log of all events: receipts and payouts. Restore the amount of money each citizen has after all events.

Input

The first line contains a single integer n (1 ≤ n ≤ 2 ⋅ 10^{5}) — the numer of citizens.

The next line contains n integers a_1, a_2, ..., a_n (0 ≤ a_{i} ≤ 10^{9}) — the initial balances of citizens.

The next line contains a single integer q (1 ≤ q ≤ 2 ⋅ 10^{5}) — the number of events.

Each of the next q lines contains a single event. The events are given in chronological order.

Each event is described as either 1 p x (1 ≤ p ≤ n, 0 ≤ x ≤ 10^{9}), or 2 x (0 ≤ x ≤ 10^{9}). In the first case we have a receipt that the balance of the p-th person becomes equal to x. In the second case we have a payoff with parameter x.

Output

Print n integers — the balances of all citizens after all events.

Examples

Input


4
1 2 3 4
3
2 3
1 2 2
2 1


Output


3 2 3 4 


Input


5
3 50 2 1 10
3
1 2 0
2 8
1 3 20


Output


8 8 20 8 10 

Note

In the first example the balances change as follows: 1 2 3 4 → 3 3 3 4 → 3 2 3 4 → 3 2 3 4

In the second example the balances change as follows: 3 50 2 1 10 → 3 0 2 1 10 → 8 8 8 8 10 → 8 8 20 8 10
import java.util.*;
import java.io.*;
 
 
public class Solution{
 
	public static Integer INT(String s){
		return Integer.parseInt(s);
	}
 
	public static Long LONG(String s){
		return Long.parseLong(s);
	}
 
	//====================================================================================================================
 
 
 	static int st_base[], st[];
 

 	public static void build(int i, int s, int e){
 		if(s==e){
 			st[i]=st_base[e];
 			return;
 		}
 		int mid=(s+e)>>1;
 		build(2*i, s, mid);
 		build(2*i+1, mid+1, e);

 		st[i]=Math.max(st[2*i], st[2*i+1]);
 	}

 	public static int query(int i, int s, int e, int qs, int qe){

 		if(qe<s || e<qs)
 			return 0;
 		if(qs<=s && e<=qe)
 			return st[i];

 		int mid=(s+e)>>1;

 		return Math.max(query(2*i, s, mid, qs, qe), query(2*i+1, mid+1, e, qs, qe));
 	}
 
	public static void main(String args[])throws IOException{
 
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));	Scanner in=new Scanner(System.in);	StringBuilder out=new StringBuilder();
 		
 		int n=in.nextInt();

 		int a[]=new int[n];
 		for(int i=0; i<n; i++)
 			a[i]=in.nextInt();

 		int time[]=new int[n];
 		Arrays.fill(time, -1);


 		int q=in.nextInt();

 		st_base=new int[q];
 		for(int i=0; i<q; i++){

 			if(in.nextInt()==2)
 				st_base[i]=in.nextInt();
 			else{
 				int pos=in.nextInt()-1,
 					update=in.nextInt();
 				a[pos]=update;
 				time[pos]=i;
 			}
 		}

 		st=new int[4*q];
 		build(1, 0, q-1);

 		for(int i=0; i<n; i++){
 			int max=0;
 			if(time[i]+1<q)
 				max=query(1, 0, q-1, time[i]+1, q-1);
 			a[i]=Math.max(a[i], max);
 		}

 		for(int i=0; i<n; i++)
 			out.append(a[i]+" ");
 		System.out.print(out);
	}
}