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.pb.codeforces.practice;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Deque;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;

import javax.print.attribute.HashAttributeSet;

public class CF1198B {

	public static class FastReader {
		BufferedReader br;
		StringTokenizer st;

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

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

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

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

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

		public String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}
	
	public static void main(String[] args) {
		FastReader in = new FastReader();
		PrintWriter out = new PrintWriter(System.out);
		int n = in.nextInt();
		int[] arr = new int[n];
		for(int i=0; i<n; i++)
			arr[i] = in.nextInt();
		int q = in.nextInt();
		int[][] events = new int[q][3];
		Deque<Integer> eq = new LinkedList<Integer>();
		for(int i=0; i<q; i++) {
			events[i][0] = in.nextInt();
			if(events[i][0] == 1) {
				 events[i][1] = in.nextInt()-1; events[i][2] = in.nextInt();
			}else {
				events[i][1] = in.nextInt();
				while(!eq.isEmpty() && events[eq.getLast()][1] <= events[i][1])
					eq.pollLast();
				eq.add(i);
			}
		}
		HashSet<Integer> set = new HashSet<Integer>();
		for(int i=0; i<arr.length; i++) {
			if(!eq.isEmpty() && arr[i] < events[eq.peek()][1])
				set.add(i);
		}
		for(int i=0; i<events.length; i++) {
			if(events[i][0] == 1) {
				int pos = events[i][1];
				int x = events[i][2];
				if(!eq.isEmpty() && arr[pos] >= events[eq.peek()][1] && x < events[eq.peek()][1])
					set.add(pos);
				else if(!eq.isEmpty() && arr[pos] < events[eq.peek()][1] && x >= events[eq.peek()][1])
					set.remove(pos);
				arr[pos] = x;
			}else {
				if(i == eq.peek()) {
					Iterator<Integer> it = set.iterator();
					while(it.hasNext()) {
						int val = it.next();
						arr[val] = events[i][1];
						it.remove();
					}
					eq.pollFirst();
				}
			}
		}
		for(int i=0; i<arr.length; i++)
			out.print(arr[i]+" ");
		out.close();
	}
}
