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

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		st = new StringTokenizer(br.readLine());
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = Integer.parseInt(st.nextToken());
		}
		st = new StringTokenizer(br.readLine());
		int q = Integer.parseInt(st.nextToken());
		int[][] queries = new int[2][q];
		for (int i = 0; i < q; i++) {
			st = new StringTokenizer(br.readLine());
			int first = Integer.parseInt(st.nextToken());
			if (first == 1) {
				queries[0][i] = Integer.parseInt(st.nextToken())-1;
			}
			else {
				queries[0][i] = -1;
			}
			queries[1][i] = Integer.parseInt(st.nextToken());
		}
		
		//last[i] is the last time step (between 0 and q, inclusive)
		//where the ith citizen is changed
		int[] last = new int[n];
		for (int i = 0; i < q; i++) {
			int val = queries[0][i];
			if (val >= 0) {
				last[val] = i+1;
			}
		}
		
		//max is the maximum forced value between time step i and q, inclusive
		int[] max = new int[q+2];
		max[q+1] = -1;
		for (int i = q; i >= 1; i--) {
			if (queries[0][i-1] == -1) {
				max[i] = Math.max(max[i+1], queries[1][i-1]);
			}
			else {
				max[i] = max[i+1];
			}
		}
		max[0] = max[1];
				
		for (int i = 0; i < n; i++) {
			int money = a[i];
			//figure out money at last time step
			if (last[i] > 0) {
				money = queries[1][last[i]-1];
			}
			System.out.print(Math.max(money, max[last[i]]) + " ");
		}
		
	}
	
}
