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 EdD {

	public static void main(String[] args) throws Exception{
		int num = 998244353;

		// TODO Auto-generated method stub
 		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
 		PrintWriter out = new PrintWriter(System.out);
 		int n = Integer.parseInt(bf.readLine());
 		int[] array = new int[n+1];
 		StringTokenizer st = new StringTokenizer(bf.readLine());
 		for(int j =0 ;j<n;j++){
 			array[j+1] = Integer.parseInt(st.nextToken());
 		}

 		int q = Integer.parseInt(bf.readLine());
 		ArrayList<Payout> payouts = new ArrayList<Payout>();
 		for(int j =0;j<q;j++){
 			StringTokenizer st1 = new StringTokenizer(bf.readLine());
 			if (Integer.parseInt(st1.nextToken())==1){
 				int p = Integer.parseInt(st1.nextToken());
 				int x = Integer.parseInt(st1.nextToken());
 				payouts.add(new Payout(1, p, x));
 			}
 			else{
 				int x = Integer.parseInt(st1.nextToken());
 				payouts.add(new Payout(2, x, -1));
 			}
 		}
 		int[] suffixmax = new int[payouts.size()+1];
 		for(int j = payouts.size()-1;j>=0;j--){
 			if (payouts.get(j).getA() == 2)
 				suffixmax[j] = Math.max(suffixmax[j+1],  payouts.get(j).getB());
 			else
 				suffixmax[j] = suffixmax[j+1];
 		}
 		Map<Integer, Integer> mp = new HashMap<Integer, Integer>();
 		for(int j =0 ;j<payouts.size();j++){
 			if (payouts.get(j).getA() == 1){
 				if (payouts.get(j).getC() <= suffixmax[j])
 					mp.put(payouts.get(j).getB(), suffixmax[j]);
 				else{
 					mp.put(payouts.get(j).getB(), payouts.get(j).getC());
 				}
 			}
 		}
 		for(int j= 1;j<=n;j++){
 			if (!mp.containsKey(j)){
 				out.print(Math.max(array[j], suffixmax[0]) + " ");
 			}
 			else
 				out.print(mp.get(j) + " ");
 		}
 		out.println();
	 		
 		out.close();
 		
 		
 		
 	}
	static class Payout{
		private int a;
		private int b;
		private int c;
		public Payout(int a, int b, int c){
			this.a = a;
			this.b = b;
			this.c = c;
		}
		public int getA() {
			return a;
		}
		public void setA(int a) {
			this.a = a;
		}
		public int getB() {
			return b;
		}
		public void setB(int b) {
			this.b = b;
		}
		public int getC() {
			return c;
		}
		public void setC(int c) {
			this.c = c;
		}
		
	}

}
 	
 
//StringJoiner sj = new StringJoiner(" "); 
//sj.add(strings)
//sj.toString() gives string of those stuff w spaces or whatever that sequence is

 		
 		
 		
 		
	


