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.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Vaibhav Pulastya
 */
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 {
        public void solve(int testNumber, InputReader in, PrintWriter out) {

            int n = in.nextInt();
            int[] a = in.nextIntArray(n);

            ArrayList<Node>[] q = new ArrayList[n];


            for (int i = 0; i < n; i++) {
                q[i] = new ArrayList<>();
            }

            int qq = in.nextInt();

            segTree q2 = new segTree(qq);
            for (int i = 0; i < qq; i++) {
                int t = in.nextInt();
                if (t == 1) {
                    int p = in.nextInt();
                    int x = in.nextInt();
                    q[p - 1].add(new Node(i, x));
                }
                if (t == 2) {
                    int x = in.nextInt();
                    q2.update(i, x);
                }
            }

            for (int i = 0; i < n; i++) {
                if (q[i].size() == 0) a[i] = Math.max(a[i], q2.query(0, qq));

                for (int j = 0; j < q[i].size(); j++) {
                    int ii = q[i].get(j).ind;
                    a[i] = q[i].get(j).val;
                    int next = (j + 1 < q[i].size()) ? q[i].get(j + 1).ind : qq;
                    a[i] = Math.max(a[i], q2.query(ii, next));
                }
            }

            for (int i = 0; i < n; i++) {
                out.print(a[i] + " ");
            }
            out.println();
        }

        class Node {
            int ind;
            int val;

            Node(int i, int v) {
                ind = i;
                val = v;
            }

        }

        public class segTree {
            int[] tree;
            int N;

            segTree(int N) {
                tree = new int[2 * N];
                this.N = N;
            }

            int query(int l, int r) {  // sum on interval [l, r)
                int res = Integer.MIN_VALUE;
                for (l += N, r += N; l < r; l >>= 1, r >>= 1) {
                    if ((l & 1) == 1) res = Math.max(tree[l++], res);
                    if ((r & 1) == 1) res = Math.max(tree[--r], res);
                }
                return res;
            }

            void update(int p, int value) {  // set value at position p
                for (tree[p += N] = value; p > 1; p >>= 1) tree[p >> 1] = Math.max(tree[p], tree[p ^ 1]);
            }

        }

    }

    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 InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

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

        public int[] nextIntArray(int size) {
            int[] array = new int[size];
            for (int i = 0; i < size; i++)
                array[i] = nextInt();
            return array;
        }

    }
}

