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.*;
public class Problem1198B {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner s=new Scanner(System.in);
		int n=s.nextInt();
		int money[][]=new int[n][2];
		for(int i=0;i<n;i++) {
			money[i][0]=s.nextInt();
		}
		int log=s.nextInt();
		TreeMap<Integer,Integer> map=new TreeMap<>();
		TreeSet<Integer> set=new TreeSet<>();
		int max_money[]=new int[log+1];
		for(int i=1;i<=log;i++) {
			int op=s.nextInt();
			if(op==1) {
				int p=s.nextInt();
				money[p-1][0]=s.nextInt();
				money[p-1][1]=i;
			}else {
				int bal=s.nextInt();
				max_money[map.size()]=bal;
				map.put(i, map.size());
				set.add(i);
			}
		}
		set.add(log+1);
		map.put(log+1, map.size());
		max_money[map.size()-1]=Integer.MIN_VALUE;
		/*
		for (Integer integer: map.keySet()) {
			System.out.println(integer+" "+map.get(integer)+" ");
		}
		for (int i : set) {
			System.out.print(i+" ");
		}
		System.out.println();
		*/
		for(int i=map.size()-2;i>=0;i--) {
			max_money[i]=Math.max(max_money[i+1], max_money[i]);
		}
		/*
		for (int i : max_money) {
			System.out.print(i+" ");
		}
		System.out.println();
		*/
		for(int i=0;i<n;i++) {
			System.out.print(Math.max(money[i][0], max_money[map.get(set.ceiling(money[i][1]))])+" ");
		}
		
	}

}
