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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Indrajit Sinha
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		DWelfareState solver = new DWelfareState();
		solver.solve(1, in, out);
		out.close();
	}

	static class DWelfareState {
		int n;
		PrintWriter out;
		InputReader in;
		int[] tree;

		public void solve(int testNumber, InputReader in, PrintWriter out) {
			int t, i, j, tt, k;
			this.out = out;
			this.in = in;
			n = in.nextInt();
			int a[] = new int[n];
			int b[] = new int[n];
			int c[] = new int[n];
			for (i = 0; i < n; i++) {
				a[i] = in.nextInt();
				b[i] = a[i];
			}
			int q = in.nextInt();
			int xx[] = new int[q];
			for (i = 0; i < q; i++) {
				int op = in.nextInt();
				if (op == 1) {
					int ox = in.nextInt() - 1;
					b[ox] = in.nextInt();
					c[ox] = i;
				} else {
					xx[i] = in.nextInt();
				}
			}
			int nn = n;
			build(xx);
			for (i = 0; i < nn; i++) {
				int ox = query(c[i], q);
				if (ox > b[i])
					b[i] = ox;
			}
			for (i = 0; i < nn; i++) {
				p(b[i]);
			}
			pn("");
		}

		void build(int[] arr) {
			n = arr.length;
			tree = new int[2 * n + 1];
			for (int i = 0; i < n; i++)
				tree[n + i] = arr[i];
			for (int i = n - 1; i > 0; --i)
				tree[i] = Math.max(tree[i << 1], tree[i << 1 | 1]);
		}

		int query(int l, int r) {
			int res = 0;
			for (l += n, r += n; l < r;
			     l >>= 1, r >>= 1) {
				if ((l & 1) > 0)
					res = Math.max(res, tree[l++]);

				if ((r & 1) > 0)
					res = Math.max(res, tree[--r]);
			}

			return res;
		}

		void pn(String zx) {
			out.println(zx);
		}

		void p(int zx) {
			out.print(zx + " ");
		}

	}

	static class InputReader {
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;

		public InputReader(InputStream stream) {
			this.stream = stream;
		}

		public int read() {
			if (numChars == -1) {
				throw new UnknownError();
			}
			if (curChar >= numChars) {
				curChar = 0;
				try {
					numChars = stream.read(buf);
				} catch (IOException e) {
					throw new UnknownError();
				}
				if (numChars <= 0) {
					return -1;
				}
			}
			return buf[curChar++];
		}

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

		public String next() {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			StringBuffer res = new StringBuffer();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));

			return res.toString();
		}

		private boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

	}
}