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.lang.reflect.Array;
import java.util.*;
import java.util.concurrent.LinkedBlockingDeque;
import java.util.concurrent.LinkedBlockingQueue;
 
public class Main {
 
 
    public static void main(String[] args) throws InterruptedException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
 
        TaskD task = new TaskD();
        task.solve(in, out);
        out.close();
    }
 
    static class TaskD {
 
        class query {
            int e, p, x;
 
            public query(int e, int p, int x) {
                this.e = e;
                this.p = p;
                this.x = x;
            }
        }
        final int MAX = 2 * 100001;
        int n;
        int balance[] = new int[MAX];
        int ans[] = new int[MAX];
        boolean served[] = new boolean[MAX];
        int q;
 
        query queries[] = new query[MAX];
        public void solve(InputReader in, PrintWriter out) throws InterruptedException {
            n = in.nextInt();
            for (int i = 0; i < n; i++) {
                balance[i] = in.nextInt();
            }
 
            q = in.nextInt();
            int rev = q;
            while (q-- > 0) {
                int e; e = in.nextInt();
                int p = 0, x;
                if (e == 1) {
                    p = in.nextInt(); x = in.nextInt(); --p;
                } else {
                    x = in.nextInt();
                }
                queries[q] = new query(e, p, x);
            }
 
            Arrays.fill(ans, -1);
            int max = 0;
            for (int i = 0; i < rev ; ++i) {
                if (queries[i].e == 1 && !served[queries[i].p]) {
                    served[queries[i].p] = true;
                    ans[queries[i].p] = Math.max(queries[i].x, max);
                } else if (queries[i].e == 2){
                    max = Math.max(max, queries[i].x);
                }
            }
 
            for (int i = 0; i < n; i++) {
                if (ans[i] == -1) {
 
                    out.print(Math.max(balance[i], max));
                } else {
                    out.print(ans[i]);
                }
                out.print(' ');
            }
            out.println();
        }
 
    }
    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
 
        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }
 
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
 
        public int nextInt() {
            return Integer.parseInt(next());
        }
 
        public double nextDouble() {
            return Double.parseDouble(next());
        }
 
    }
 
}