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;
vector<long long int> a, t, lazy;
void push(int v) {
  lazy[v + v] = max(lazy[v + v], lazy[v]);
  lazy[v + v + 1] = max(lazy[v + v + 1], lazy[v]);
  lazy[v] = 0;
}
void update(int v, int tl, int tr, int pt, int x) {
  if (tl == tr) {
    a[tl] = x;
    lazy[v] = 0;
  } else {
    push(v);
    int tm = (tl + tr) / 2;
    if (pt <= tm)
      update(v + v, tl, tm, pt, x);
    else {
      update(v + v + 1, tm + 1, tr, pt, x);
    }
  }
}
int get_value(int v, int tl, int tr, int pt) {
  if (tl == tr) {
    a[tl] = max(lazy[v], a[tl]);
    return a[tl];
  } else {
    int tm = (tl + tr) / 2;
    push(v);
    if (pt <= tm)
      return get_value(v + v, tl, tm, pt);
    else
      return get_value(v + v + 1, tm + 1, tr, pt);
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  cin >> n;
  t.resize(4 * n);
  a.resize(n);
  lazy.resize(4 * n, 0);
  for (int i = 0; i < n; i++) cin >> a[i];
  int q;
  cin >> q;
  long long int p, x, y;
  while (q--) {
    cin >> y;
    if (y == 1) {
      cin >> p >> x;
      update(1, 0, n - 1, p - 1, x);
    } else {
      cin >> x;
      push(1);
      lazy[1] = max(lazy[1], x);
    }
  }
  for (int i = 0; i < n; i++) cout << get_value(1, 0, n - 1, i) << " ";
}
