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.awt.*;
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;

import static java.lang.Math.*;

public class Main {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    PrintWriter pw = new PrintWriter(System.out);

    public Main() throws FileNotFoundException {
    }

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

    String next() throws IOException {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }

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

    public static void main(String[] args) throws IOException {
        new Main().run();
    }

    void add(int x, Deque<Integer> d) {
        while (!d.isEmpty() && d.peekLast() > x) {
            d.pollLast();
        }
        d.addLast(x);
    }

    void remove(int x, Deque<Integer> d) {
        if (!d.isEmpty() && d.peekFirst() == x) {
            d.pollFirst();
        }
    }

    void run() throws IOException {
        int n = nextInt();
        int[] a = new int[n];
        for (int i = 0; i < a.length; i++) {
            a[i] = nextInt();
        }
        int q = nextInt();
        int[][] b = new int[q][3];
        for (int i = 0; i < q; i++) {
            int e = nextInt();
            if (e == 1) {
                b[i][0] = 1;
                b[i][1] = nextInt();
                b[i][2] = nextInt();
            } else {
                b[i][0] = e;
                b[i][1] = nextInt();
            }
        }
        int max = -1;
        boolean[] used = new boolean[n];
        int[] ans = new int[n];
        for (int i = b.length - 1; i >= 0; i--) {
            if (b[i][0] == 1) {
                int pos = b[i][1] - 1;
                int x = b[i][2];
                if (!used[pos]) {
                    used[pos] = true;
                    if (max == -1) {
                        ans[pos] = x;
                    } else {
                        ans[pos] = max(x, max);
                    }
                }
            } else {
                int x = b[i][1];
                max = max(max, x);
            }
        }
        for (int i = 0; i < n; i++) {
            if (!used[i]) {
                ans[i] = max(a[i], max);
            }
        }
        for (int i = 0; i < ans.length; i++) {
            pw.print(ans[i] + " ");
        }
        pw.close();
    }

    class Pair {
        long ves;
        int from, to;

        public Pair(long a, int c, int b) {
            ves = a;
            from = c;
            to = b;
        }
    }

    static class PairComp implements Comparator<Pair> {

        @Override
        public int compare(Pair o1, Pair o2) {
            return Long.compare(o1.ves, o2.ves);
        }
    }
}