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
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 100;
int a[N], t[N * 4], t1[N * 4];
void push(int v) {
  if (t1[v] == -1) return;
  t1[v + v] = max(t1[v], t1[v + v]);
  t1[v + v + 1] = max(t1[v], t1[v + v + 1]);
  t[v + v] = max(t1[v], t[v + v]);
  t[v + v + 1] = max(t1[v], t[v + v + 1]);
  t1[v] = -1;
}
void built(int v, int tl, int tr) {
  t1[v] = -1;
  if (tl == tr) {
    t[v] = a[tl];
    return;
  }
  int tm = (tl + tr) / 2;
  built(v + v, tl, tm);
  built(v + v + 1, tm + 1, tr);
}
void upd(int v, int tl, int tr, int pos, int val) {
  if (tl == tr) {
    t[v] = val;
    return;
  }
  push(v);
  int tm = (tl + tr) / 2;
  if (pos <= tm) {
    upd(v + v, tl, tm, pos, val);
  } else {
    upd(v + v + 1, tm + 1, tr, pos, val);
  }
}
int get(int v, int tl, int tr, int pos) {
  if (tl == tr) {
    return t[v];
  }
  push(v);
  int tm = (tl + tr) / 2;
  if (pos <= tm) {
    return get(v + v, tl, tm, pos);
  } else {
    return get(v + v + 1, tm + 1, tr, pos);
  }
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  built(1, 1, n);
  int q;
  cin >> q;
  for (int i = 1; i <= q; i++) {
    int type, x, pos;
    cin >> type;
    if (type == 1) {
      cin >> pos >> x;
      upd(1, 1, n, pos, x);
    } else {
      cin >> x;
      t1[1] = max(t1[1], x);
      t[1] = max(x, t[1]);
    }
  }
  for (int i = 1; i <= n; i++) {
    cout << get(1, 1, n, i) << " ";
  }
  return 0;
}
