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
//package com.arnavarora.usaco_prac;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class Omnom {
	public static void main(String[] args) throws Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int[] money = new int[n];
		boolean[] visited = new boolean[n];
		//read in data to array
		st = new StringTokenizer(br.readLine());
		for (int x=0; x<n; x++) {
			money[x] = Integer.parseInt(st.nextToken());
		}
		st = new StringTokenizer(br.readLine());
		int m = Integer.parseInt(st.nextToken());
		Request[] reqs = new Request[m];
		boolean a = false;
		for (int x = 0; x<m; x++) {
			st = new StringTokenizer(br.readLine());
			int choice = Integer.parseInt(st.nextToken());
			if (choice==1) {
				a = true;
			}else {
				a = false;
			}
			if (a) {
				reqs[x] = new Request(true, Integer.parseInt(st.nextToken())-1, Integer.parseInt(st.nextToken()));
			}else {
				reqs[x] = new Request(false, -1, Integer.parseInt(st.nextToken()));
			}
			
		}
		//read data backwards
		//for each step, if receipt and not visited: set equal to max(max_payout, receipt)
		//if payout: change max_payout
		//go through array and if visited, print it
		//else print max(max_payout, starting_val)
		int max_payout = 0;
		for (int i = m-1; i>=0; i--) {
			if (reqs[i].choice && !visited[reqs[i].person]) {
				money[reqs[i].person] = Math.max(max_payout, reqs[i].amount);
				visited[reqs[i].person] = true;
			}else if (!reqs[i].choice) {
				max_payout = Math.max(reqs[i].amount, max_payout);
			}
		}
		for (int i = 0; i<n; i++) {
			if (visited[i]) {
				System.out.println(money[i]);
			}else {
				System.out.println(Math.max(max_payout, money[i]));
			}
		}
		br.close();
		out.close();
}
	static class Request{
		boolean choice;
		int person, amount;
		public Request(boolean which, int who, int how) {
			choice = which;
			if (choice) {
				person = who;
			}
			amount = how;
		}
	}
}
