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
//Created by Aminul on 11/18/2019.

import java.io.*;
import java.util.*;

import static java.lang.Math.*;

public class B {
    public static void main(String[] args) throws Exception {
        InputReader in = new InputReader(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        int n = in.nextInt();
        int a[][] = new int[n + 1][];
        for (int i = 1; i <= n; i++) {
            int x = in.nextInt();
            a[i] = new int[]{0, x};
        }
        int q = in.nextInt();
        int update[] = new int[q + 2];
        update[q + 1] = -1;
        for (int i = 1; i <= q; i++) {
            int op = in.nextInt();
            if (op == 1) {
                int p = in.nextInt(), x = in.nextInt();
                a[p] = new int[]{i, x};
            } else {
                int x = in.nextInt();
                update[i] = x;
            }
        }
        for (int i = q; i >= 0; i--) {
            update[i] = max(update[i], update[i + 1]);
        }

        int ans[] = new int[n + 1];
        for (int i = 1; i <= n; i++) {
            int time = a[i][0], lastVal = a[i][1];
            if (update[time + 1] > lastVal) lastVal = update[time + 1];
            ans[i] = lastVal;
        }

        for (int i = 1; i <= n; i++) {
            pw.print(ans[i] + " ");
        }
        pw.println();

        pw.close();
    }

    static void debug(Object... obj) {
        System.err.println(Arrays.deepToString(obj));
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() throws Exception {
            while (tokenizer == null || !tokenizer.hasMoreTokens())
                tokenizer = new StringTokenizer(reader.readLine());
            return tokenizer.nextToken();
        }

        public String nextLine() throws Exception {
            String line = null;
            tokenizer = null;
            line = reader.readLine();
            return line;
        }

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

        public double nextDouble() throws Exception {
            return Double.parseDouble(next());
        }

        public long nextLong() throws Exception {
            return Long.parseLong(next());
        }

    }
}