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

	static int n;

	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner();
		PrintWriter out = new PrintWriter(System.out);
		n=sc.nextInt();
		int []a=new int [n];
		SegmentTree st=new SegmentTree();
		for(int i=0;i<n;i++)
		{
			a[i]=sc.nextInt();
			st.update(i, i, a[i]);
		}
		int q=sc.nextInt();
		while(q-->0) {
			int t=sc.nextInt();
			if(t==1) {
				int idx=sc.nextInt()-1,v=sc.nextInt();
				st.update(idx, idx, v);
			}
			else {
				st.update(0, n-1, sc.nextInt());
			}
		}
		for(int i=0;i<n;i++)
			out.print(st.query(i)+" ");
		out.close();

	}

	static class SegmentTree {
		int[] tree, lazy;

		SegmentTree() {
			tree = new int[4 * n];
		}

		int query(int idx) {
			return query(1,0,n-1,idx);
		}
		int query(int node,int tl,int tr,int idx) {
			if(tl==tr)
				return tree[node];
			propagate(node);
			int mid = tl + tr >> 1, left = node << 1, right = left | 1;
			if(idx<=mid)
				return query(left,tl,mid,idx);
			else
				return query(right,mid+1,tr,idx);
			
		}

		void update(int l, int r, int v) {
			update(1, 0, n - 1, l, r, v);
		}

		void propagate(int node) {
			int left = node << 1, right = left + 1;
			tree[left] = Math.max(tree[left], tree[node]);
			tree[right] = Math.max(tree[right], tree[node]);
			tree[node] = 0;

		}

		void update(int node, int tl, int tr, int l, int r, int v) {
			if (tr < l || r < tl)
				return;
			if (tl >= l && tr <= r) {
				if (tl == tr)
					tree[node] = v;
				else
					tree[node] = Math.max(tree[node], v);
			} else {
				propagate(node);
				int mid = tl + tr >> 1, left = node << 1, right = left | 1;
				update(left, tl, mid, l, r, v);
				update(right, mid + 1, tr, l, r, v);
			}

		}
	}

	static class Scanner {
		BufferedReader br;
		StringTokenizer st;

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

		Scanner(String fileName) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(fileName));
		}

		String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		String nextLine() throws IOException {
			return br.readLine();
		}

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

		long nextLong() throws NumberFormatException, IOException {
			return Long.parseLong(next());
		}

		double nextDouble() throws NumberFormatException, IOException {
			return Double.parseDouble(next());
		}

		boolean ready() throws IOException {
			return br.ready();
		}

	}

}