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
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;

/**
 *
 * @author is2ac
 */
public class D_CF {

    public static void main(String[] args) {
        FastScanner58 fs = new FastScanner58();
        PrintWriter pw = new PrintWriter(System.out);
        //int t = fs.ni();
        int t = 1;
        for (int tc = 0; tc < t; tc++) {
           int n = fs.ni();
           int[] a = fs.intArray(n);
           int q = fs.ni();
           PriorityQueue<int[]> pq = new PriorityQueue(new Comparator<int[]>(){
               public int compare(int[] b, int[] c) {
                   return b[2]-c[2];
               }
           });
           Map<Integer,int[]> map = new HashMap();
           for (int i = 0; i < n; i++) {
               map.put(i, new int[] {-1,a[i]});
           }
           Stack<int[]> wave = new Stack();
           
           int last = -1;
           for (int i = 0; i < q; i++) {
               int type = fs.ni();
               if (type==1) {
                   int p = fs.ni()-1;
                   int x = fs.ni();
                   map.put(p,new int[] {i,x});
                   pq.add(new int[] {i,p,x});
                   
               } else {
                   int x = fs.ni();
                   while (!wave.isEmpty() && wave.peek()[1]<x) {
                       wave.pop();
                   }
                  wave.add(new int[] {i,x});
               }
           }
           if (last!=-1) {
               for (int i = 0; i < n; i++) {
                   a[i] = Math.max(a[i],last);
               }
           }
           TreeMap<Integer,Integer> tm = new TreeMap();
           while (!wave.isEmpty()) {
               int[] b = wave.pop();
               int time = b[0], x = b[1];
               tm.put(time,x);
           }
           for (int i = 0; i < n; i++) {
               int[] b = map.get(i);
               int time = b[0], x = b[1];
               Integer c = tm.higherKey(time);
               a[i] = x;
               if (c!=null) a[i] = Math.max(x,tm.get(c));
           }
           for (int i = 0; i < n; i++) {
               pw.print(a[i] + " " );
           }
        }
        pw.close();
    }
    public static int recur(int ind, int k, int[][] a, Integer[][] dp, List<List<Integer>> list) {
        if (k<0) return (int)(-1e9);
        if (ind==a.length) return 0;
        if (k-a[ind][1]<0) return (int)(-1e9);
        k += a[ind][2];
        if (dp[ind][k]!=null) return dp[ind][k];
        List<Integer> temp = list.get(ind);
        List<Integer> por = new ArrayList();
        for (int j = 0; j < temp.size(); j++) {
            por.add(a[temp.get(j)][3]);
        }
        Collections.sort(por);
        int c = 0, p = 0;
        int n = recur(ind+1,k,a,dp,list);
        for (int j = por.size()-1; j > -1; j--) {
            c += por.get(j);
            p++;
            n = Math.max(n,recur(ind+1,k-p,a,dp,list)+c);
        }
        return dp[ind][k] = n;
    }
    public static long gcd(long n1, long n2) {
        if (n2 == 0) {
            return n1;
        }
        return gcd(n2, n1 % n2);
    }
}
class UnionFind18 {

    int[] id;

    public UnionFind18(int size) {
        id = new int[size];
        for (int i = 0; i < size; i++) {
            id[i] = i;
        }
    }

    public int find(int p) {
        int root = p;
        while (root != id[root]) {
            root = id[root];
        }
        while (p != root) {
            int next = id[p];
            id[p] = root;
            p = next;
        }
        return root;
    }

    public void union(int p, int q) {
        int a = find(p), b = find(q);
        if (a == b) {
            return;
        }
        id[b] = a;
    }
}

class FastScanner58 {

    BufferedReader br;
    StringTokenizer st;

    public FastScanner58() {
        br = new BufferedReader(new InputStreamReader(System.in), 32768);
        st = null;
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int ni() {
        return Integer.parseInt(next());
    }

    int[] intArray(int N) {
        int[] ret = new int[N];
        for (int i = 0; i < N; i++) {
            ret[i] = ni();
        }
        return ret;
    }

    long nl() {
        return Long.parseLong(next());
    }

    long[] longArray(int N) {
        long[] ret = new long[N];
        for (int i = 0; i < N; i++) {
            ret[i] = nl();
        }
        return ret;
    }

    double nd() {
        return Double.parseDouble(next());
    }

    String nextLine() {
        String str = "";
        try {
            str = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return str;
    }
}

class UnionFind17 {

    int[] id;

    public UnionFind17(int size) {
        id = new int[size];
        for (int i = 0; i < size; i++) {
            id[i] = i;
        }
    }

    public int find(int p) {
        int root = p;
        while (root != id[root]) {
            root = id[root];
        }
        while (p != root) {
            int next = id[p];
            id[p] = root;
            p = next;
        }
        return root;
    }

    public void union(int p, int q) {
        int a = find(p), b = find(q);
        if (a == b) {
            return;
        }
        id[b] = a;
    }
}
