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.*;
import java.util.ArrayList;
import java.util.Collections;

public class B1198 {
    public static void main(String[] args) throws IOException{
        BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
        int size = Integer.parseInt(inp.readLine());
        int[] given = new int[size];
        String[] s1 = inp.readLine().split(" ");
        for(int i=0;i<size;i++){
            given[i] = Integer.parseInt(s1[i]);
        }
        int lines = Integer.parseInt(inp.readLine());
        int a=0,b=0;
        int globalMax = 0;
        int[][] delta = new int[size][];
        ArrayList<Querry> querry = new ArrayList<>();

        for(int i=0;i<lines;i++){
            String[] s2 = inp.readLine().split(" ");
            if(s2[0].equals("1")){
                a = Integer.parseInt(s2[1])-1;
                b = Integer.parseInt(s2[2]);
                querry.add(new Querry(1,a,b));
            }
            else{
                a = Integer.parseInt(s2[1]);
                querry.add(new Querry(2,a,0));
            }
        }
        ArrayList<Integer> max = new ArrayList<>();
        boolean[] visited = new boolean[size];
        int localMax = 0;
        for(int i=lines-1;i>=0;i--){
            if(querry.get(i).a==2){
                localMax = Math.max(localMax,querry.get(i).b);
            }
            else {
                if(!visited[querry.get(i).b]){
                    given[querry.get(i).b] = Math.max(querry.get(i).c,localMax);
                    visited[querry.get(i).b] = true;
                }
            }
        }

        for(int i=0;i<size;i++){
            if(given[i]<localMax && visited[i]==false){
                given[i] = localMax;
            }
            out.write(given[i]+" ");
        }


        out.flush();
    }
}
class Querry{
    int a,b,c;
    Querry(int a,int b,int c){
        this.a = a;
        this.b = b;
        this.c = c;
    }
}

