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 = 1e6 + 10;
inline void read(int &a) {
  a = 0;
  int d = 1;
  char ch;
  while (ch = getchar(), ch > '9' || ch < '0')
    if (ch == '-') d = -1;
  a = ch ^ 48;
  while (ch = getchar(), ch >= '0' && ch <= '9')
    a = (a << 3) + (a << 1) + (ch ^ 48);
  a *= d;
}
inline void write(int x) {
  if (x < 0) putchar(45), x = -x;
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
int a[N];
struct note {
  int tp, x, y = 0;
} q[N];
int vis[N];
int main() {
  int n;
  read(n);
  for (register int i = 1; i <= n; i++) read(a[i]);
  int T;
  read(T);
  int maxn = 0;
  for (register int i = 1; i <= T; i++) {
    int x;
    read(x);
    if (x == 1) {
      int l, r;
      read(l);
      read(r);
      q[i].tp = 1;
      q[i].x = l;
      q[i].y = r;
    } else {
      int l;
      read(l);
      q[i].tp = 2;
      q[i].x = l;
    }
  }
  int xx;
  for (register int i = T; i > 0; i--) {
    if (q[i].tp == 1 && !vis[q[i].x]) {
      if (q[i].y < maxn)
        a[q[i].x] = maxn;
      else
        a[q[i].x] = q[i].y;
      vis[q[i].x] = 1;
    } else if (q[i].tp == 2 && maxn < q[i].x) {
      maxn = q[i].x;
    }
  }
  for (register int i = 1; i <= n; i++)
    if (a[i] < maxn && !vis[i]) a[i] = maxn;
  for (register int i = 1; i <= n; i++) write(a[i]), putchar(' ');
  return 0;
}
