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.*;
import java.io.*;

public class WelfareState {
    public static void main(String[] args) {
        FastScanner scanner = new FastScanner();
        PrintWriter out = new PrintWriter(System.out);
        int n = scanner.nextInt();
        //Probably pq useful and remove as type 1 are executed
        int[] last = new int[n];
        int[] arr = new int[n];
        for(int i = 0; i < n; i++) arr[i] = scanner.nextInt();
        ArrayList<Pair> list = new ArrayList<>();
        TreeSet<Pair> set = new TreeSet<>();
        ArrayList<Pair> evs = new ArrayList<>();
        int q = scanner.nextInt();
        Arrays.fill(last, -1);
        for(int i = 0; i < q; i++) {
            int e = scanner.nextInt();
            if (e == 1) {
                int p = scanner.nextInt();
                int x = scanner.nextInt();
                Pair pp = new Pair(p-1, x);
                pp.c = i;
                last[p-1] = i;
                list.add(pp);
            }
            else {
                int x = scanner.nextInt();
                set.add(new Pair(x, i));
                evs.add(new Pair(x, i));
            }
        }
        ArrayList<Pair> peeps = new ArrayList<>();
        for(int i = 0; i < n; i++) {
            peeps.add(new Pair(last[i], i));
        }
        Collections.sort(peeps);
        int[] ans = new int[n];
        int p = 0;
        int o = 0;
        for(Pair pp: list) {
            while(p < n && peeps.get(p).a < pp.c) {
                ans[peeps.get(p).b] = Math.max(arr[peeps.get(p).b], !set.isEmpty() ? set.last().a: -1);
                p++;
            }
            while(o < evs.size() && evs.get(o).b < pp.c) set.remove(evs.get(o++));
            arr[pp.a] = pp.b;
        }
        while(p < n) {
            ans[peeps.get(p).b] = Math.max(arr[peeps.get(p).b], !set.isEmpty() ? set.last().a: -1);
            p++;
        }
        for(int i = 0; i < n; i++) {
            out.print(ans[i] + " ");
        }
        out.println();
        out.flush();
    }
    static class Pair implements Comparable<Pair> {
        int a,b,c;
        public Pair(int aa, int bb) {
            a = aa; b = bb;
        }
        public int compareTo(Pair o) {
            if (a == o.a) return b -o.b;
            return a -o.a;
        }
    }
    public static class FastScanner {
        BufferedReader br;
        StringTokenizer st;
        
        public FastScanner(Reader in) {
            br = new BufferedReader(in);
        }
        
        public FastScanner() {
            this(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 readNextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}
