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

	public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

	public static void main(String[] args) throws IOException {
		readInput();
		out.close();
	}

	public static void readInput() throws IOException {
		// br = new BufferedReader(new FileReader(".in"));
		// out = new PrintWriter(new FileWriter(".out"));
		int n = Integer.parseInt(br.readLine());
		int[] a = new int[n];
		int[] c = new int[n];
		StringTokenizer st = new StringTokenizer(br.readLine());
		for (int i = 0; i < n; i++) {
			a[i] = Integer.parseInt(st.nextToken());
			c[i] = -1;
		}
		boolean[] used = new boolean[n];
		int max = 0;
		int q = Integer.parseInt(br.readLine());
		
		List<Integer> queries = new ArrayList<Integer>(), queryType = new ArrayList<Integer>();
		for (int tq = 0; tq < q; tq++) {
			st = new StringTokenizer(br.readLine());
			if (Integer.parseInt(st.nextToken()) == 1) {
				int ind = Integer.parseInt(st.nextToken())-1;
				a[ind] = Integer.parseInt(st.nextToken());
				queryType.add(1);
				queries.add(ind);
			}
			else {
				queryType.add(2);
				queries.add(Integer.parseInt(st.nextToken()));
			}
		}
		for (int i = q-1; i >= 0; i--) {
			if (queryType.get(i) == 1) {
				if (!used[queries.get(i)]) {
					a[queries.get(i)] = Integer.max(max, a[queries.get(i)]);
					used[queries.get(i)] = true;
				}
			}
			else {
				max = Integer.max(max, queries.get(i));
			}
		}
		for (int i = 0; i < used.length; i++) {
			if (!used[i]) {
				a[i] = Integer.max(max, a[i]);
				used[i] = true;
			}
		}
		for (int x: a) out.print(x + " ");
		out.println();
	}
}
