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.*;
public class Main{
    static Scanner sc=new Scanner(System.in);
    static StreamTokenizer in=new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
    static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));
    static int maxn=200055;
    public static void main(String args[])throws Exception{
        int n=getInt();
        int arr[]=new int[maxn];
        Node ns[]=new Node[maxn];
        for(int i=1;i<=n;i++){
            arr[i]=getInt();
        }
        int m=getInt();
        boolean vis[]=new boolean[maxn];
        for(int i=0;i<m;i++){
            int a=getInt();
            int b=getInt();
            int c=0;
            if(a==1){
                c=getInt();
            }
            ns[i]=new Node(a,b,c);
        }
        int max=-999999999;
        for(int i=m-1;i>=0;i--){
            if(ns[i].a==2){
                max=Math.max(max,ns[i].b);
            }
            if(ns[i].a==1){
                if(!vis[ns[i].b]){
                    vis[ns[i].b]=true;
                    if(ns[i].c<=max){
                        ns[i].c=max;
                    }
                }else{
                    ns[i].flag=false;
                }
            }
        }
        for(int i=1;i<=n;i++)
        {
            arr[i]=Math.max(arr[i],max);
        }

        for(int i=0;i<m;i++)
        {
            if(ns[i].a==1&&ns[i].flag)
            {
                arr[ns[i].b]=ns[i].c;
            }
        }

        for(int i=1;i<=n;i++){
            if(i!=1) System.out.print(" ");
            System.out.print(arr[i]);
        }
    }
    static int getInt() throws Exception{
        in.nextToken();
        return (int)in.nval;
    }
}
class Node{
    int a,b,c;
    boolean flag=true;
    public Node(int a,int b,int c){
        this.a=a;
        this.b=b;
        this.c=c;
    }
}