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.Arrays;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;

/**
 * @author khokharnikunj8
 */

public class Main {
    public static void main(String[] args) {
        new Thread(null, new Runnable() {
            public void run() {
                new Main().solve();
            }
        }, "1", 1 << 26).start();
    }

    void solve() {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BWelfareState solver = new BWelfareState();
        solver.solve(1, in, out);
        out.close();
    }

    static class BWelfareState {
        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            int n = in.scanInt();
            int[] ar = new int[n];
            for (int i = 0; i < n; i++) ar[i] = in.scanInt();
            int q = in.scanInt();
            int[][] query = new int[q][3];
            int[] pay = new int[q + 1];
            for (int i = 0; i < q; i++) {
                query[i][0] = in.scanInt();
                query[i][1] = in.scanInt();
                if (query[i][0] == 1) query[i][2] = in.scanInt();
                else pay[i + 1] = query[i][1];
            }
            SegmentTreeMax segmentTreeMax = new SegmentTreeMax(pay, q);
            int[] last = new int[n];
            Arrays.fill(last, 1);
            for (int i = 0; i < q; i++) {
                if (query[i][0] == 1) {
                    ar[query[i][1] - 1] = query[i][2];
                    last[query[i][1] - 1] = i + 1;
                }
            }
            for (int i = 0; i < n; i++) {
                ar[i] = Math.max(ar[i], pay[segmentTreeMax.query(last[i], q)]);
                out.print(ar[i] + " ");
            }


        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int index;
        private BufferedInputStream in;
        private int total;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (index >= total) {
                index = 0;
                try {
                    total = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (total <= 0) return -1;
            }
            return buf[index++];
        }

        public int scanInt() {
            int integer = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    integer *= 10;
                    integer += n - '0';
                    n = scan();
                }
            }
            return neg * integer;
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

    }

    static class SegmentTreeMax {
        int n;
        int[] t;
        int[] data;

        public SegmentTreeMax(int[] data, int n) {
            this.data = data;
            this.n = n;
            this.t = new int[2 * (n + 3)];
            build();
        }

        void build() {
            for (int i = 0; i < n; i++) t[i + n] = i + 1;
            for (int i = n - 1; i > 0; --i)
                t[i] = (data[t[i << 1]] >= data[t[i << 1 | 1]] ? t[i << 1] : t[(i << 1 | 1)]);
        }

        public int query(int l, int r) {
            int res = l;
            for (l += n - 1, r += n; l < r; l >>= 1, r >>= 1) {
                if ((l & 1) != 0) {
                    res = (data[res] > data[t[l]] ? res : t[l]);
                    l++;
                }
                if ((r & 1) != 0) {
                    r--;
                    res = (data[res] > data[t[r]] ? res : t[r]);
                }
            }
            return res;
        }

    }
}

