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.StringTokenizer;

import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

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

    static class Task {
        public void solve(int testNumber, InputReader sc, PrintWriter out) {
            SegTree t=new SegTree();
            t.solve(sc, out);
            out.println();
        }

    }
    
    static  class SegTree{
    	static class Node{
        	int l;
        	int r;
        	long sum;
        	long add;
        	
        	public Node(int l,int r) {
        		this.l=l;
        		this.r=r;
        	}
        }
    	
    	public static int[] a;
    	public static Node[] t;
    	
    	public void build(int p,int l,int r) {
    		t[p]=new Node(l,r);
    		if(l==r) {
    			t[p].sum=a[l];
    			return ;
    		}
    		int mid=(l+r)>>1;
    		build(p*2,l,mid);
    		build(p*2+1,mid+1,r);
    	}
    	
    	public void spread(int p) {
    		if(t[p].add!=0) {
    			t[p*2].sum=Math.max(1l*t[p].add*(t[p*2].r-t[p*2].l+1), t[p*2].sum);
    			t[p*2+1].sum=Math.max(1l*t[p].add*(t[p*2+1].r-t[p*2+1].l+1), t[p*2+1].sum);
    			t[p*2].add=Math.max(t[p*2].add, t[p].add);
    			t[p*2+1].add=Math.max(t[p*2+1].add, t[p].add);
    			t[p].add=0;
    		}
    	}
    	
    	public void change1(int p,int l,int r,long d) {
    		if(l<=t[p].l&&r>=t[p].r) {
    			t[p].sum=1l*(t[p].r-t[p].l+1)*d;
    			t[p].add=d;
    			return ;
    		}
    		spread(p);
    		int mid=(t[p].l+t[p].r)>>1;
    		if(l<=mid) 
    			change1(p*2,l,r,d);
    		if(r>mid)
    			change1(p*2+1,l,r,d);
    	}
    	
    	public void change2(int p,int l,int r,long d) {
    		if(l<=t[p].l&&r>=t[p].r) {
    			t[p].sum=Math.max(1l*(t[p].r-t[p].l+1)*d, t[p].sum);
    			t[p].add=Math.max(d, t[p].add);
    			return ;
    		}
    		spread(p);
    		int mid=(t[p].l+t[p].r)>>1;
    		if(l<=mid) 
    			change2(p*2,l,r,d);
    		if(r>mid)
    			change2(p*2+1,l,r,d);
    	}
    	
    	public long ask(int p,int l,int r) {
    		if(t[p].l>=l&&t[p].r<=r) {
    			return t[p].sum;
    		}
    		spread(p);
    		long ans=0;
    		int mid=(t[p].l+t[p].r)>>1;
    		if(l<=mid)
    			ans+=ask(p*2,l,r);
    		if(r>mid)
    			ans+=ask(p*2+1,l,r);
    		return ans;
    	}
    	
        public void solve(InputReader sc, PrintWriter out) {
            int n=sc.nextInt();
            t=new Node[4*n+1];
            a=new int[n+1];
            
            for(int i=1;i<=n;i++)
            	a[i]=sc.nextInt();
            build(1,1,n);
            int q=sc.nextInt();
            while(q-->0) {
            	int opt=sc.nextInt();
            	if(opt==1) {
            		int p=sc.nextInt();
            		int x=sc.nextInt();
            		change1(1,p,p,x);
            	}
            	else {
            		int x=sc.nextInt();
            		change2(1,1,n,x);
            	}
            }
            for(int i=1;i<=n;i++)
            	out.print(ask(1,i,i)+" ");
            out.println();
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

        public long nextLong() {
            return Long.parseLong(next());
        }

    }
}
