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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Random;
import java.util.StringTokenizer;

public class TaskC {
	static long mod = (long) (1000000000+7);
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		FastReader sc = new FastReader();
		PrintWriter out = new PrintWriter(System.out);
		
		int test = 1;
		while(test-->0) {
			int n = sc.nextInt();
			long[] a = new long[n+1];
			for(int i = 0;i<n;i++) {
				a[i+1] = sc.nextLong();
			}
			
			int q = sc.nextInt();
			//TreeSet<Integer> set = new TreeSet<>();
			Pair[] last = new Pair[n+1];
			int lastmax = -1;
			int[] suffq = new int[q+1];
			for(int i = 0;i<q;i++) {
				int type = sc.nextInt();
				if(type==1) {
					last[sc.nextInt()] = new Pair(sc.nextInt(), i);
				} else {
					suffq[i] = sc.nextInt();
					if(suffq[i]>lastmax) {
						lastmax = suffq[i];
					}
				}
			}
			int curr = 0;
			for(int i = q-1;i>=0;i--) {
				if(suffq[i]==0) {
					suffq[i] = curr;	
				} else {
					curr = Math.max(suffq[i], curr);
					suffq[i] = curr;	
				}
			}
			for(int i = 1;i<=n;i++) {
				if(last[i]==null) {
					if(a[i]>suffq[0]) {
						out.print(a[i]+" ");
					} else {
						out.print(suffq[0]+" ");
					}
				} else {
					if(last[i].m>suffq[last[i].time]) {
						out.print(last[i].m+" ");
					} else {
						out.print(suffq[last[i].time]+" ");
					}
				}
			}
			out.println();
			
		}
		
		out.close();
	}
	static class Pair {
		int time, m;
		public Pair(int a, int b) {
			m = a;
			time = b;
		}
	}
	static void shuffleArray(int[] arr){
        int n = arr.length;
        Random rnd = new Random();
        for(int i=0; i<n; ++i){
            int tmp = arr[i];
            int randomPos = i + rnd.nextInt(n-i);
            arr[i] = arr[randomPos];
            arr[randomPos] = tmp;
        }   
	}
	static int log2(int n){
	    if(n <= 0) throw new IllegalArgumentException();
	    return 31 - Integer.numberOfLeadingZeros(n);
	}
	static class FastReader {
		
		StringTokenizer st;
		BufferedReader br;
		
		public FastReader() {
			br = new BufferedReader(
					new InputStreamReader(System.in));
		}
		
		String next() {
			while(st==null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}
		
		int nextInt() {
			return Integer.parseInt(next());
		}
		
		long nextLong() {
			return Long.parseLong(next());
		}
		
		double nextDouble() { 
			return Double.parseDouble(next()); 
		} 
		
		String nextLine() {
			String s = "";
			while(st==null || st.hasMoreElements()) {
				try {
					s = br.readLine();
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return s;
		}
	}
}
