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.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.PrintWriter;
import java.util.Scanner;

public class LineSegmentTree {
    int []val;
    int []lazy;
    int []a;
    void pushUp(int rt){

    }
    void pushDown(int rt,int ln,int rn){
        if(lazy[rt]!=0){
            lazy[rt<<1] = Math.max(lazy[rt<<1],lazy[rt]);
            lazy[rt<<1|1] = Math.max(lazy[rt<<1|1],lazy[rt]);
            val[rt<<1] = Math.max(val[rt<<1],lazy[rt]);
            val[rt<<1|1] = Math.max(val[rt<<1|1],lazy[rt]);
            lazy[rt]=0;
        }
    }
    void build(int l,int r,int rt){
        lazy[rt] = 0;
        if(l==r){
            val[rt] = a[l];
            return;
        }
        int mid = (l+r)>>1;
        build(l,mid,rt<<1);
        build(mid+1,r,rt<<1|1);
        pushUp(rt);
    }
    void updatePoint(int R,int C,int l,int r,int rt){
        if(l==r){
            val[rt] = C;
            return;
        }
        int mid = (l+r)>>1;
        pushDown(rt,mid-l+1,r-mid);
        if(R<=mid){
            updatePoint(R,C,l,mid,rt<<1);
        }else{
            updatePoint(R,C,mid+1,r,rt<<1|1);
        }
        pushUp(rt);
    }
    void updateSegment(int L,int R,int C,int l,int r,int rt){
        if(L==l&&r==R){
            val[rt] = Math.max(val[rt],C);
            lazy[rt] = Math.max(lazy[rt],C);
            return;
        }
        int mid = (l+r)>>1;
        pushDown(rt,mid-l+1,r-mid);
        if(R<=mid){
            updateSegment(L,R,C,l,mid,rt<<1);
        }else if(mid<L){
            updateSegment(L,R,C,mid+1,r,rt<<1|1);
        }else{
            updateSegment(L,mid,C,l,mid,rt<<1);
            updateSegment(mid+1,R,C,mid+1,r,rt<<1|1);
        }
        pushUp(rt);
    }
    int querySegment(int L,int R,int l,int r,int rt){
        if(l==L&&R==r){
            return val[rt];
        }
        int mid = (l+r)>>1;
        pushDown(rt,mid-l+1,r-mid);
        int ret = 0;
        if(R<=mid){
            ret = querySegment(L,R,l,mid,rt<<1);
        } else if(mid<L){
            ret = querySegment(L,R,mid+1,r,rt<<1|1);
        }else{
            ret = querySegment(L,mid,l,mid,rt<<1)+querySegment(mid+1,R,mid+1,r,rt<<1|1);
        }
        pushUp(rt);
        return ret;
    }
    LineSegmentTree(int []a){
        this.a = a;
        this.lazy = new int[a.length<<2];
        this.val = new int[a.length<<2];
    }
    public static void main(String[] args){
        Scanner in = new Scanner(new BufferedInputStream(System.in));
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

        int n = in.nextInt();
        int[] a = new int[n+1];
        for(int i=1;i<=n;i++){
            a[i] = in.nextInt();
        }
        int q = in.nextInt();
        int b,c,d;
        LineSegmentTree lineSegmentTree = new LineSegmentTree(a);
        lineSegmentTree.build(1,n,1);
        while(q--!=0){
            b = in.nextInt();
            if(b==1){
                //单点更新
                c = in.nextInt();
                d = in.nextInt();
                lineSegmentTree.updatePoint(c,d,1,n,1);
            }else if(b==2){
                //区间更新
                c = in.nextInt();
                lineSegmentTree.updateSegment(1,n,c,1,n,1);
            }
        }
        for(int i=1;i<=n;i++){
            out.print(lineSegmentTree.querySegment(i,i,1,n,1));
            if(i!=n){
                out.print(" ");
            }
        }
        out.println();
        out.close();
    }
}
