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
//package CodeforcesJava;

import java.io.*;
import java.util.HashSet;
import java.util.Objects;
import java.util.Set;
import java.util.StringTokenizer;

public class Main {

    public void solve(InputProvider in, PrintWriter out) throws IOException {
        int count = in.nextInt();
        int[] men = new int[count];
        Set<Integer> menSet = new HashSet<>();
        for (int i = 0; i < men.length; i++) {
            men[i] = in.nextInt();
            menSet.add(i);
        }
        int records = in.nextInt();
        String[] commands = new String[records];
        for (int i = 0; i < records; i++) {
            commands[i] = in.nextLine();
        }
        int nextLevel = 0;
        for (int i = commands.length - 1; i >= 0 && !menSet.isEmpty(); i--) {
            StringTokenizer tokenizer = new StringTokenizer(commands[i]);
            int type = Integer.parseInt(tokenizer.nextToken());
            if (type == 1) {
                int index = Integer.parseInt(tokenizer.nextToken()) - 1;
                int balance = Integer.parseInt(tokenizer.nextToken());
                if (menSet.contains(index)) { // Last personal balance.
                    //noinspection ManualMinMaxCalculation
                    if (balance > nextLevel) { // Balance is bigger than next level.
                        men[index] = balance;
                    } else { // Up to level.
                        men[index] = nextLevel;
                    }
                    menSet.remove(index); // Balance is final.
                }
            } else {
                int level = Integer.parseInt(tokenizer.nextToken());
                if (level > nextLevel) { // Remember max level.
                    nextLevel = level;
                }
            }
        }
        for (Integer index : menSet) { // No personal records.
            if (men[index] < nextLevel) { // Up to level.
                men[index] = nextLevel;
            }
        }
        for (Integer man : men) {
            out.printf("%d ", man);
        }
    }

    public static void main(String[] args) throws Exception {
        try (InputProvider input = new InputProvider(System.in);
             PrintWriter output = new PrintWriter(System.out)) {
            new Main().solve(input, output);
        }
    }

    public static class InputProvider implements AutoCloseable {

        private final BufferedReader reader;
        private StringTokenizer tokenizer;

        public InputProvider(Reader reader) {
            this.reader = new BufferedReader(reader);
        }

        public InputProvider(InputStream input) {
            reader = new BufferedReader(new InputStreamReader(input));
        }

        public String next() throws IOException {
            if (Objects.isNull(tokenizer) || !tokenizer.hasMoreTokens())
                tokenizer = new StringTokenizer(reader.readLine());
            return tokenizer.nextToken();
        }

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

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

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

        public String nextLine() throws IOException {
            return reader.readLine();
        }

        @Override
        public void close() throws Exception {
            reader.close();
        }

    }

}