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
#576_D

import sys

n = int(input())

a = [int(i) for i in input().split(" ")]
lasts = [0] * n

q = int(input())

mins = []

trs = []

for i in range(0, q):
    tr = [int(i) for i in sys.stdin.readline().rstrip().split(" ")]
    if tr[0] == 1:
        a[tr[1] - 1] = tr[2]
        lasts[tr[1] - 1] = i
    trs.append(tr)

ct = 0
for i in range(len(trs) - 1, -1, -1):
    if trs[i][0] == 2:
        if ct == 0:
            mins.append(trs[i][1])
        else:
            mins.append(max(mins[-1], trs[i][1]))
    else:
        if ct == 0:
            mins.append(0)
        else:
            mins.append(mins[-1])
    ct += 1

mins = mins[::-1]

carr = []

for i in range(0, len(a)):
    carr.append(max(a[i], mins[lasts[i]]))

print(" ".join([str(i) for i in carr]))
        
