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 {
    	static Scanner sc = new Scanner(System.in);
    	static long MAX = (long) (Math.pow(2,32)-1);
    	static PrintWriter pw = new PrintWriter(System.out);
    	public static void main(String[] args) {
    		int n = sc.nextInt();
    		int arr[] = new int[n];
    		for(int i = 0; i < n; i++) {
    			arr[i] = sc.nextInt();
    		}
    		int q = sc.nextInt();
    		int[] queries = new int[q];
    		int[] pees = new int[n];
    		Arrays.fill(pees,-1);
    		int max = 0;
    		for(int i = 0; i< q; i++) {
    			int t = sc.nextInt();
    			if(t==1) {
    				int p = sc.nextInt(), x = sc.nextInt();
    				pees[p-1] = i;
    				arr[p-1] = x;
    			}
    			else {
    				int x = sc.nextInt();
    				max = Math.max(x,max);
    				queries[i] = x;
    			}
    		}
    		for(int i = q-2; i >=0; i--) {
    			queries[i] = Math.max(queries[i],queries[i+1]);
    		}
    		StringBuilder sb = new StringBuilder();
    		for(int i = 0; i< n; i++) {
    			int val = arr[i];
    			if(pees[i]==-1) {
    				val = Math.max(val,max);
    			}
    			else{
    				val = Math.max(val, queries[pees[i]]);
    			}
    			sb.append(val +" ");
    		}
    		System.out.println(sb.toString());
    	}
    	
    	public static String compare(String s1, String s2) {
    		if(s1.length()>s2.length()) {
    			return s2;
    		}
    		else if(s2.length()>s1.length()) {
    			return s1;
    		}
    		else {
    			if(s1.compareTo(s2)<0) return s1;
    			else return s2;
    		}
    	}
    	public static String sum(String s1, String s2) {
    //		System.out.println(s1+" "+s2);
    		StringBuilder sb = new StringBuilder();
    		StringBuilder temp1 = new StringBuilder(s1);
    		StringBuilder temp2 = new StringBuilder(s2);
    		s1 = temp1.reverse().toString();
    		s2 = temp2.reverse().toString();
    //		System.out.println(s1+" "+s2);
    		int n = s1.length(), m = s2.length();
    		int i = 0, carry = 0;
    		while(i<n && i<m) {
    			int x = (s1.charAt(i) + s2.charAt(i) - '0' - '0' + carry);
    			sb.append(x%10);
    			carry = x/10;
    			i++;
    		}
    		while(i<n) {
    			int x = (s1.charAt(i) -'0' + carry);
    			sb.append(x%10);
    			carry = x/10;
    			i++;
    		}
    		while(i<m) {
    			int x = (s2.charAt(i) -'0' + carry);
    			sb.append(x%10);
    			carry = x/10;
    			i++;
    		}
    		if(carry!=0) {
    			sb.append(carry);
    		}
    		return sb.reverse().toString();
    	}
    }