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.io.*;
import java.util.*;


public class Main {
	
	static class Scanner
	{
	    BufferedReader buf;
	    StringTokenizer tok;
	    Scanner()
	    {
	        buf = new BufferedReader(new InputStreamReader(System.in));
	    }
	    
	    boolean hasNext()
	    {
	        while(tok == null || !tok.hasMoreElements()) 
	        {
	            try
	            {
	                tok = new StringTokenizer(buf.readLine());
	            } 
	            catch(Exception e) 
	            {
	                return false;
	            }
	        }
	        return true;
	    }
	    
	    String next()
	    {
	        if(hasNext()) return tok.nextToken();
	        return null;
	    }
	    
	    int nextInt()
	    {
	        return Integer.parseInt(next());
	    }
	    
	    long nextLong()
	    {
	        return Long.parseLong(next());
	    }
	    
	    double nextDouble()
	    {
	        return Double.parseDouble(next());
	    }
	    
	}

	
	public static void main(String[] args) {
		Scanner sc = new Scanner();
		PrintWriter out = new PrintWriter(System.out);
		int n = sc.nextInt();
		int[] arr = new int[n];
		int min = Integer.MIN_VALUE;
		boolean[] flag = new boolean[n];
		for(int i = 0; i < n; i++)
			arr[i] = sc.nextInt();
		int q = sc.nextInt();
		int[][] query = new int[q][3];
		for(int i = 0; i < q; i++) {
			query[i][0] = sc.nextInt();
			query[i][1] = sc.nextInt();
			if(query[i][0] == 1) query[i][2] = sc.nextInt();
		}
		for(int i = q-1; i >= 0; i--) {
			if(query[i][0] == 2) min = Math.max(min, query[i][1]);
			else{
				int idx = query[i][1]-1;
				if(!flag[idx]) {
					arr[idx] = Math.max(query[i][2], min);
					flag[idx] = true;
				}
			}
		}
		for(int i = 0; i < n; i++) {
			if(!flag[i])
				out.print(Math.max(min, arr[i]));
			else out.print(arr[i]);
			if(i != n-1) out.print(" ");
		}
		out.close();
	}
	
    
   
}