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.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

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

    static class TaskB {
        public void solve(int testNumber, FastScanner in, PrintWriter out) {
            int n = in.nextInt();
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = in.nextInt();
            }
            int numQueries = in.nextInt();
            int[] batchUpdateTimes = new int[numQueries];
            int[] batchUpdateValues = new int[numQueries];
            int numBatchUpdates = 0;
            int[] lastUpdate = new int[n];
            for (int queryId = 0; queryId < numQueries; queryId++) {
                int t = in.nextInt();
                if (t == 1) {
                    int i = in.nextInt() - 1;
                    a[i] = in.nextInt();
                    lastUpdate[i] = queryId + 1;
                } else {
                    batchUpdateTimes[numBatchUpdates] = queryId + 1;
                    batchUpdateValues[numBatchUpdates] = in.nextInt();
                    ++numBatchUpdates;
                }
            }
            batchUpdateTimes = Arrays.copyOf(batchUpdateTimes, numBatchUpdates);
            batchUpdateValues = Arrays.copyOf(batchUpdateValues, numBatchUpdates);
            int[] maxOnSuffix = new int[numBatchUpdates];
            for (int i = numBatchUpdates - 1; i >= 0; i--) {
                maxOnSuffix[i] = batchUpdateValues[i];
                if (i + 1 < numBatchUpdates) {
                    maxOnSuffix[i] = Math.max(maxOnSuffix[i], maxOnSuffix[i + 1]);
                }
            }

            for (int i = 0; i < n; i++) {
                int t = lastUpdate[i];
                int l = -1;
                int r = numBatchUpdates;
                while (r - l > 1) {
                    int m = (l + r) / 2;
                    if (t <= batchUpdateTimes[m]) {
                        r = m;
                    } else {
                        l = m;
                    }
                }
                if (r < numBatchUpdates) {
                    a[i] = Math.max(a[i], maxOnSuffix[r]);
                }
            }

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

    }

    static class FastScanner {
        private BufferedReader in;
        private StringTokenizer st;

        public FastScanner(InputStream stream) {
            in = new BufferedReader(new InputStreamReader(stream));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(in.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

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

    }
}

