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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.StringTokenizer;

public class WEl {

	static class FastReader { 
		BufferedReader br; 
		StringTokenizer st; 

		public FastReader() 
		{ 
			br = new BufferedReader(new
					InputStreamReader(System.in)); 
		} 

		String next() 
		{ 
			while (st == null || !st.hasMoreElements()) 
			{ 
				try
				{ 
					st = new StringTokenizer(br.readLine()); 
				} 
				catch (IOException  e) 
				{ 
					e.printStackTrace(); 
				} 
			} 
			return st.nextToken(); 
		} 

		int nextInt() 
		{ 
			return Integer.parseInt(next()); 
		} 

		long nextLong() 
		{ 
			return Long.parseLong(next()); 
		} 

		double nextDouble() 
		{ 
			return Double.parseDouble(next()); 
		} 

		String nextLine() 
		{ 
			String str = ""; 
			try
			{ 
				str = br.readLine(); 
			} 
			catch (IOException e) 
			{ 
				e.printStackTrace(); 
			} 
			return str; 
		} 
	}

	static class Node {
		int f;
		int s;
		int t;

		Node(int f, int s){
			this.f=f;
			this.s=s;
			this.t=0;
		}

		Node(int f, int s, int t){
			this.f=f;
			this.s=s;
			this.t=t;
		}
	}

	public static void main(String[] args) {

		FastReader sc = new FastReader();
		OutputStream outputstream = System.out;
		PrintWriter out = new PrintWriter(outputstream);

		int n = sc.nextInt();
		int[] arr = new int[n];
		for(int i = 0; i < n; i++) arr[i] = sc.nextInt();
		int q = sc.nextInt();
		ArrayList<Node> al = new ArrayList();
		int t = q;
		HashSet<Integer> torem = new HashSet();
		for(int i = 0; i < n; i++) torem.add(i);
		int max = 0;;
		while(q--!=0) {
			int now = sc.nextInt();
			if(now==1) {
				int p = sc.nextInt();
				p--;
				int x = sc.nextInt();
				al.add(new Node(now,p,x));
			} else {
				int x = sc.nextInt();
				max = Math.max(max, x);
				al.add(new Node(now,x));
			}
		}
		for(int i = 0; i < t; i++){
			if(al.get(i).f==1){
				int ind = al.get(i).s;
				torem.remove(ind);
				int val = al.get(i).t;
				arr[ind] = val;
			}
		}
		int[] maxx = new int[t];
		for(int i = 0; i < t; i++){
			if(al.get(i).f==2) {
				maxx[i] = al.get(i).s;
			}
		}
		for(int i = t-2; i >= 0; i--){
			int tmp = maxx[i];
			maxx[i] = Math.max(tmp, maxx[i+1]);
		}
		HashSet<Integer> hs = new HashSet();
		for(int i = t-1; i>=0; i--){
			if(al.get(i).f==1) {
				if(!hs.contains(al.get(i).s)) {
					hs.add(al.get(i).s);
					int self = arr[al.get(i).s];
					arr[al.get(i).s] = Math.max(arr[al.get(i).s],maxx[i]);
				}
			}
		}
		for(int i = 0; i < n; i++){
			if(torem.contains(i)){
				arr[i] = Math.max(arr[i], max);
			}
		}
		for(Integer i : arr) {
			out.print(i + " ");
		}
		out.println();
		out.close();
	}

}