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.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

/*
 * 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.
 */

/**
 *
 * @author Andy Phan
 */
public class b {
    public static void main(String[] args) {
        FS in = new FS(System.in);
        PrintWriter out = new PrintWriter(System.out);
        
        int n = in.nextInt();
        Node tree = new Node(0, n);
        for(int i = 0; i < n; i++) tree.update(i, in.nextInt());
        
        int q = in.nextInt();
        for(int i = 0; i < q; i++) {
            int type = in.nextInt();
            if(type == 2) {
                int x = in.nextInt();
                tree.clear(x);
            } else {
                tree.update(in.nextInt()-1, in.nextInt());
            }
        }
        for(int i = 0; i < n; i++) out.print(tree.sum(i) + " ");
        out.println();
        
        out.close();
    }
    
    static class Node {
        int l, r;
        long tot, prop;
        Node left, right;
        
        public Node(int le, int ri) {
            l = le;
            r = ri;
            if(l == r-1) return;
            int mid = (le+ri)>>1;
            left = new Node(le, mid);
            right = new Node(mid, ri);
        }
        
        public void prop() {
            if(left == null) return;
            if(prop == 0) return;
            left.prop = Math.max(prop, left.prop);
            right.prop = Math.max(prop, right.prop);
            prop = 0;
        }
        
        public void update(int ind, int num) {
            if(ind >= r || ind < l) return;
            if(left == null) {
                if(tot <= prop) tot = prop;
                prop = 0;
                tot = num;
                return;
            }
            prop();
            left.update(ind, num);
            right.update(ind, num);
        }
        
        public void clear(int num) {
            prop = Math.max(prop, num);
        }
        
        public long sum(int ind) {
            if(ind < l || ind >= r) return 0;
            if(left == null) {
                if(tot <= prop) tot = prop;
                prop = 0;
                return tot;
            }
            prop();
            return left.sum(ind) + right.sum(ind);
        }
    }
    
    static class FS {

        BufferedReader in;
        StringTokenizer token;
        
        public FS(InputStream str) {
            in = new BufferedReader(new InputStreamReader(str));
        }
        
        public String next() {
            if (token == null || !token.hasMoreElements()) {
                try {
                    token = new StringTokenizer(in.readLine());
                } catch (IOException ex) {
                }
                return next();
            }
            return token.nextToken();
        }
        
        public int nextInt() {
            return Integer.parseInt(next());
        }
    }
}
