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 com.company;

import java.util.*;

public class Main {

    public static void main(String[] args) {
	    // write your code here
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] arr = new int[n];
        for(int i = 0; i < n; i++) arr[i] = scan.nextInt();
        int q = scan.nextInt();
        int[][] event = new int[q][3];
        List<Integer[]> payout = new ArrayList<>();

        for(int i = 0; i < q; i++) {
            event[i][0] = scan.nextInt();
            event[i][1] = scan.nextInt();
            if(event[i][0] == 1) event[i][2] = scan.nextInt();
            else payout.add(new Integer[]{event[i][1], i});
        }

        Collections.sort(payout, (lhs, rhs)->{
            if (lhs[0] == rhs[0]) return Integer.compare(rhs[1], lhs[1]);
            else return Integer.compare(rhs[0], lhs[0]);
        });

        List<Integer[]> effective = new ArrayList<>();
        if(payout.size() > 0) {
            effective.add(payout.get(0));
            int u = 0;
            for(int i = 1; i < payout.size(); i++) {
                if(payout.get(i)[1] > effective.get(u)[1]) {
                    u++;
                    effective.add(payout.get(i));
                }
            }
        }

        int j = 0;
        for(int i = 0; i < n; i++) {
            if(j < effective.size() && arr[i] < effective.get(j)[0]) arr[i] = effective.get(j)[0];
        }

        for(int i = 0; i < q; i++) {
            if(event[i][0] == 1) {
                if(j >= effective.size() || event[i][2] > effective.get(j)[0]) {
                    arr[event[i][1] - 1] = event[i][2];
                } else {
                    arr[event[i][1] - 1] = effective.get(j)[0];
                }
            } else if(j < effective.size() && i == effective.get(j)[1]){
                j++;
            }
        }

        for(int i = 0; i < n - 1; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println(arr[n - 1]);
    }
}
