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.util.Arrays;
import java.util.Scanner;

public class Main {
	
	public static void main(String[] args)
	{
		Scanner s=new Scanner(System.in);
		
		int n=s.nextInt();
		
		int[] arr=new int[n];
		
		for(int i=0;i<n;i++)
		{
			arr[i]=s.nextInt();
		}
		
		int q=s.nextInt();
		
		int[] max=new int[q];
		pair[] query=new pair[q];
		int[] last=new int[n];
		
		Arrays.fill(last, -1);
		
		for(int i=0;i<q;i++)
		{
			int a=s.nextInt();
			
			if(a==1)
			{
				int index=s.nextInt();
				int value=s.nextInt();
				
				pair p=new pair(a,index,value);
				query[i]=p;
				
				last[index-1]=i;
			}
			else
			{
				int val=s.nextInt();
				
				pair p=new pair(a,-1,val);
				query[i]=p;
			}
		}
		
		if(query[q-1].type==2)
		{
			max[q-1]=query[q-1].value;
		}
		else
		{
			max[q-1]=0;
		}
		
		for(int i=q-2;i>=0;i--)
		{
			if(query[i].type==2)
			{
				max[i]=Math.max(query[i].value,max[i+1]);
			}
			else
			{
				max[i]=max[i+1];
			}
		}
		
		for(int i=0;i<n;i++)
		{
			if(last[i]==-1)
			{
				arr[i]=Math.max(arr[i],max[0]);
			}
			else
			{
				arr[i]=Math.max(max[last[i]], query[last[i]].value);
			}
		}
		
		for(int i=0;i<n;i++)
		{
			System.out.print(arr[i]+" ");
		}
		
		System.out.println();
		
	}
	
}

class pair
{
	int type;
	int index;
	int value;
	
	public pair(int type,int index,int value)
	{
		this.type=type;
		this.index=index;
		this.value=value;
	}
}