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
# @author 

import sys

class DWelfareState:
    def solve(self):
        n = int(input())
        a = [int(_) for _ in input().split()]
        q = int(input())
        queries = []
        v = [[-1, a[i]] for i in range(n)]
        x_max = [-float('inf')] * (q + 1)
        for qi in range(q):
            query = [int(_) for _ in input().split()]
            queries.append(query)
            type = query[0]
            if type == 1:
                i, x = query[1:]
                i -= 1
                v[i] = [qi, x]
                # x_max[qi] = x_max[qi - 1]
            else:
                x = query[1]
                x_max[qi] = max(x_max[qi - 1], x)

        suff = [0] * (q + 1)
        suff[-1] = -float('inf')
        for i in range(q - 1, -1, -1):
            suff[i] = max(suff[i + 1], x_max[i])

        ans = [0] * n
        for i in range(n):
            ans[i] = max(suff[v[i][0] + 1], v[i][1])

        # print(v)
        # print(x_max)
        print(*ans)

solver = DWelfareState()
input = sys.stdin.readline

solver.solve()
