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
// This template code suggested by KT BYTE Computer Science Academy
//   for use in reading and writing files for USACO problems.

// https://content.ktbyte.com/problem.java

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

public class WelfareState {

    static StreamTokenizer in;

    static int nextInt() throws IOException {
        in.nextToken();
        return (int) in.nval;
    }

    public static void main(String[] args) throws Exception {
        in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

        int n = nextInt();

        int[] balances = new int[n];

        for (int i = 0; i < n; i++) {
            balances[i] = nextInt();
        }

        int q = nextInt();

        ArrayList<Action> actions = new ArrayList<>();

        for (int i = 0; i < q; i++) {
            int code = nextInt();

            if (code == 1) {
                int p = nextInt()-1;
                int x = nextInt();

                actions.add(new Action(code, p, x));
            }

            else {
                int x = nextInt();

                actions.add(new Action(code, x, 0));
            }
        }

        int maxWW = 0;

        boolean[] locked = new boolean[n];

        for (int i = actions.size()-1; i >= 0; i--) {
            Action a = actions.get(i);
            if (a.code == 1) {
                if (locked[a.p1]) continue;
                balances[a.p1] = Math.max(maxWW, a.p2);
                locked[a.p1] = true;
            }
            else {
                maxWW = Math.max(maxWW, a.p1);
            }
        }

        for (int i = 0; i < n; i++) {
            if (!locked[i]) {
                balances[i] = Math.max(balances[i], maxWW);
            }
        }

        for (int i = 0; i < n; i++) {
            out.print(balances[i]);

            if (i != n-1) out.print(" ");
        }

        out.close();
    }

    static class Action {
        int code, p1, p2;

        Action(int code, int p1, int p2) {
            this.code = code;
            this.p1 = p1;
            this.p2 = p2;
        }
    }
}


