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.util.ArrayList;
import java.io.InputStream;

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

    static class DWelfareState {
        static int[] st;
        static int[] arr;

        int getMid(int s, int e) {
            return s + (e - s) / 2;
        }

        int MaxUtil(int ss, int se, int l,
                    int r, int node) {
            if (l <= ss && r >= se)
                return st[node];

            if (se < l || ss > r)
                return -1;

            int mid = getMid(ss, se);

            return Math.max(
                    MaxUtil(ss, mid, l, r, 2 * node + 1),
                    MaxUtil(mid + 1, se, l, r, 2 * node + 2)
            );
        }

        int getMax(int n, int l, int r) {
            return MaxUtil(0, n - 1, l, r, 0);
        }

        int constructSTUtil(int ss, int se, int si) {
            if (ss == se) {
                st[si] = arr[ss];
                return arr[ss];
            }

            int mid = getMid(ss, se);

            st[si] = Math.max(
                    constructSTUtil(ss, mid, si * 2 + 1),
                    constructSTUtil(mid + 1, se, si * 2 + 2)
            );

            return st[si];
        }

        void constructST(int n) {
            int x = (int) (Math.ceil(Math.log(n) / Math.log(2)));
            int max_size = 2 * (1 << x) - 1;
            st = new int[max_size];
            constructSTUtil(0, n - 1, 0);
        }

        public void solve(int testNumber, inputClass sc, PrintWriter out) {
            int n = sc.nextInt();
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = sc.nextInt();
            }
            int q = sc.nextInt();
            int x, y, z;
            int[] lastupdate = new int[n];
            Arrays.fill(lastupdate, -1);
            ArrayList<Integer> tab = new ArrayList<>();
            for (int i = 0; i < q; i++) {
                x = sc.nextInt();
                if (x == 1) {
                    y = sc.nextInt() - 1;
                    z = sc.nextInt();
                    a[y] = z;
                    lastupdate[y] = tab.size();
                } else {
                    y = sc.nextInt();
                    tab.add(y);
                }
            }
            if (tab.size() == 0) {
                for (int i = 0; i < n; i++) {
                    out.print(a[i] + " ");
                }
                return;
            }
            arr = new int[tab.size()];
            for (int i = 0; i < tab.size(); i++) {
                arr[i] = tab.get(i);
            }
            constructST(tab.size());
            int[] ans = new int[n];
            for (int i = 0; i < n; i++) {
                if (lastupdate[i] == -1) {
                    int max = getMax(tab.size(), 0, tab.size() - 1);
                    ans[i] = Math.max(a[i], max);
                } else if (lastupdate[i] == tab.size()) {
                    ans[i] = a[i];
                } else {
                    int max = getMax(tab.size(), lastupdate[i], tab.size() - 1);
                    ans[i] = Math.max(a[i], max);
                }
            }
            for (int i = 0; i < n; i++) {
                out.print(ans[i] + " ");
            }
        }

    }

    static class inputClass {
        BufferedReader br;
        StringTokenizer st;

        public inputClass(InputStream in) {

            br = new BufferedReader(new InputStreamReader(in));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

    }
}

