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.math.BigInteger;
import java.util.*;

public class tr0 {
	static PrintWriter out;
	static StringBuilder sb;
	static final double EPS = 1e-9;
	static long mod = 998244353;
	static int inf = (int) 1e9 + 2;
	static long[] fac;
	static int[] si;
	static ArrayList<Integer> primes;
	static ArrayList<Integer>[] ad;
	static ArrayList<pair>[] d;
	static edge[] ed;
	static boolean f;
	static int n, m;
	static int[][] a;
	static Queue<Integer>[] can;
	static String[] ss;

	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		out = new PrintWriter(System.out);
        int n=sc.nextInt();
        int N = 1; while(N < n) N <<= 1; //padding	
		int[] a = new int[N + 1];
		for(int i = 1; i <= n; i++)
			a[i] = sc.nextInt();
        SegmentTree s=new SegmentTree(a);
        int q=sc.nextInt();
        while(q-->0) {
        	if(sc.nextInt()==1) {
        		int f=sc.nextInt();
        		s.update_range(f, f,sc.nextInt(),0);
        	}
        	else {
        		int x=sc.nextInt();
        		s.update_range(1, n, x,1);
        	}
        }
        for(int i=1;i<=n;i++)
        	out.print(s.query(i, i)+" ");
		out.close();
	}
    
	static int getref(int x) {
		if(x==0)
			return 5;
		if(x==1)
			return 3;
		if(x==3)
			return 1;
		if(x==4)
			return 2;
		if(x==2)
			return 4;
		if(x==5)
			return 0;
		return 5;
	}
	static boolean ref(int h, int g) {
		if (h == 0 && g == 5)
			return true;
		if (h == 1 && g == 3)
			return true;
		if (h == 2 && g == 4)
			return true;
		return false;
	}

	static Queue<Integer> k, k1;
	static boolean hg = false;

	static void ifCan(int i) {
		if (i == 6) {
			hg = true;
			for (int j : k)
				k1.add(j);
			return;
		} else if (k.contains(i))
			ifCan(i + 1);
		else {
			if (!hg) {
				for (int p : can[i]) {
					if (!k.contains(p)) {
						k.add(i);
						k.add(p);
						ifCan(i + 1);
						k.remove(i);
						k.remove(p);
					}
				}
			}
		}
	}

	static class qu implements Comparable<qu> {
		int a;
		int b;

		qu(int a, int b) {
			this.a = a;
			this.b = b;
		}

		public String toString() {
			return a + " " + b;
		}

		@Override
		public int compareTo(qu o) {
			return b - o.b;
		}
	}


	static class pair {
		int to;
		int number;

		pair(int t, int n) {
			number = n;
			to = t;
		}

		public String toString() {
			return to + " " + number;
		}
	}

	static void con() {
		for (int i = 0; i < n; i++)
			d[i] = new ArrayList();
		for (int i = 0; i < m; i++) {
			if (in[i]) {
				edge w = ed[i];
				d[w.from].add(new pair(w.to, w.number));
				d[w.to].add(new pair(w.from, w.number));
			}
		}
	}

	static boolean[] in;

	/*
	 * static void mst() { Arrays.sort(ed); UnionFind uf=new UnionFind(n); for(int
	 * i=0;i<m;i++) { edge w=ed[i]; if(!uf.union(w.from, w.to)) continue;
	 * in[i]=true; } }
	 */
	static class edge implements Comparable<edge> {
		int from;
		int to;
		int number;

		edge(int f, int t, int n) {
			from = f;
			to = t;
			number = n;
		}

		public String toString() {
			return from + " " + to + " " + number;
		}

		public int compareTo(edge f) {
			return number - f.number;
		}
	}

	static class seg implements Comparable<seg> {
		int a;
		int b;

		seg(int s, int e) {
			a = s;
			b = e;
		}

		public String toString() {
			return a + " " + b;
		}

		public int compareTo(seg o) {
			// if(a==o.a)
			return o.b - b;
			// return
		}
	}

	
	static long power(int i) {
		// if(i==0)
		// return 1;
		long a = 1;
		for (int k = 0; k < i; k++)
			a *= i;
		return a;
	}

	static void seive() {
		si = new int[1000001];
		primes = new ArrayList<>();
		int N = 1000001;
		si[1] = 1;
		for (int i = 2; i < N; i++) {
			if (si[i] == 0) {
				si[i] = i;
				primes.add(i);
			}
			for (int j = 0; j < primes.size() && primes.get(j) <= si[i] && (i * primes.get(j)) < N; j++)
				si[primes.get(j) * i] = primes.get(j);

		}
	}

	static long inver(long x) {
		int a = (int) x;
		long e = (mod - 2);
		long res = 1;
		while (e > 0) {
			if ((e & 1) == 1) {
				// System.out.println(res*a);
				res = (int) ((1l * res * a) % mod);
			}
			a = (int) ((1l * a * a) % mod);
			e >>= 1;
		}
		// out.println(res+" "+x);
		return res % mod;
	}
static	public class SegmentTree {		// 1-based DS, OOP
		
		int N; 			//the number of elements in the array as a power of 2 (i.e. after padding)
		int[] array, sTree, lazy;
		
		SegmentTree(int[] in)		
		{
			array = in; N = in.length - 1;
			sTree = new int[N<<1];		//no. of nodes = 2*N - 1, we add one to cross out index zero
			lazy = new int[N<<1];
		//	Arrays.fill(lazy, Integer.MAX_VALUE);
			build(1,1,N);
		}
		
		void build(int node, int b, int e)	// O(n)
		{
			if(b == e)					
				sTree[node] = array[b];
			else						
			{
				int mid = b + e >> 1;
				build(node<<1,b,mid);
				build(node<<1|1,mid+1,e);
				sTree[node] = Math.max(sTree[node<<1],sTree[node<<1|1]);
			}
		}
		
		
		void update_point(int index, int val)			// O(log n)
		{
			index += N - 1;				
			sTree[index] = val;			
			lazy[index]=-1;
			while(index>1)				
			{
				index >>= 1;
				sTree[index] = Math.max(sTree[index<<1] , sTree[index<<1|1]);		
			}
		}
		
		
		void update_range(int i, int j, int val,int rr)		// O(log n) 
		{
			update_range(1,1,N,i,j,val,rr);
		}
		
		void update_range(int node, int b, int e, int i, int j, int val,int rr)
		{
			if(i > e || j < b)		
				return;
			if(b >= i && e <= j)		
			{
				
				if(rr==0) {
			//		System.out.println(val+"VO");
					sTree[node] = val;
					lazy[node] = val;	
					return;
				}
				if(sTree[node]<val)
			    	  sTree[node] = val;
				if(val>lazy[node])
				     lazy[node] = val;				
			}							
			else		
			{
				int mid = b + e >> 1;
				propagate(node, b, mid, e);
				update_range(node<<1,b,mid,i,j,val,rr);
				update_range(node<<1|1,mid+1,e,i,j,val,rr);
				sTree[node] = Math.max(sTree[node<<1] , sTree[node<<1|1]);		
			}
			
		}
		void propagate(int node, int b, int mid, int e)		
		{
			if(lazy[node<<1]<lazy[node])
			lazy[node<<1] = lazy[node];
			if(lazy[node<<1|1]<lazy[node])
			lazy[node<<1|1] = lazy[node];
			if(sTree[node<<1]<lazy[node])
			sTree[node<<1] = lazy[node];	
			if(sTree[node<<1|1]<lazy[node])
			sTree[node<<1|1] = lazy[node];		
			lazy[node] = 0;
		//	}
		}
		
		int query(int i, int j)
		{
			return query(1,1,N,i,j);
		}
		
		int query(int node, int b, int e, int i, int j)	// O(log n)
		{
			if(i>e || j <b)
				return 0;		
			if(b>= i && e <= j)
				return sTree[node];
			int mid = b + e >> 1;
			propagate(node, b, mid, e);
			int q1 = query(node<<1,b,mid,i,j);
			int q2 = query(node<<1|1,mid+1,e,i,j);
			return Math.max(q1, q2);	
					
		}
	}
	static long fac(int n) {
		if (n == 0)
			return fac[n] = 1;
		if (n == 1)
			return fac[n] = 1;
		long ans = 1;
		for (int i = 1; i <= n; i++)
			fac[i] = ans = (i % mod * ans % mod) % mod;
		return ans % mod;
	}

	static int gcd(int a, int b) {

		if (b == 0)
			return a;
		return gcd(b, a % b);
	}

	static class unionfind {
		int[] p;
		int[] size, time, val;
		int l;

		unionfind(int n) {
			p = new int[n * 3];
			size = new int[n * 3];
			val = new int[n * 3];
			l = n;
			for (int i = 0; i < p.length; i++) {
				p[i] = i;
			}
			Arrays.fill(size, 1);
		}

		int findSet(int v) {
			if (v == p[v])
				return v;
			int t = p[v];
			int f = findSet(p[v]);
			if (t != f)
				val[v] += val[t];
			return p[v] = f;
		}

		boolean sameSet(int a, int b) {
			a = findSet(a);
			b = findSet(b);
			if (a == b)
				return true;
			return false;
		}

		int max() {
			int max = 0;
			for (int i = 0; i < size.length; i++)
				if (size[i] > max)
					max = size[i];
			return max;
		}

		int ans(int i) {
			int o = findSet(i);
			return val[i];
		}

		boolean combine(int a, int b, int cost) {
			a = findSet(a);
			b = findSet(b);
			if (a == b)
				return true;
			++l;
			p[a] = l;
			p[b] = l;
			size[l] = size[a] + size[b];
			val[a] += cost * size[b];
			val[b] += cost * size[a];
			return false;
		}
	}

	static class Scanner {
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}

		public Scanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}

		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		public String nextLine() throws IOException {
			return br.readLine();
		}

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

		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}

		public char nextChar() throws IOException {
			return next().charAt(0);
		}

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

		public boolean ready() throws IOException {
			return br.ready();
		}

		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
	}
}