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<pair<long long, long long> > amt;
vector<pair<long long, long long> > payoffs;
vector<long long> maximum_payoff;
int upper_bound(int ts) {
  int lo = 0;
  int ho = payoffs.size();
  int mid;
  while (lo < ho) {
    mid = (lo + ho) / 2;
    if (payoffs[mid].second > ts)
      ho = mid;
    else
      lo = mid + 1;
  }
  return lo;
}
int main() {
  int N;
  cin >> N;
  amt.resize(N);
  for (int i = 0; i < N; i++) {
    cin >> amt[i].first;
    amt[i].second = 0;
  }
  int Q;
  cin >> Q;
  int ts = 0;
  while (Q--) {
    int type;
    cin >> type;
    ts++;
    if (type == 1) {
      long long p, x;
      cin >> p >> x;
      amt[p - 1].first = x;
      amt[p - 1].second = ts;
    } else {
      long long x;
      cin >> x;
      payoffs.push_back(pair<long long, long long>(x, ts));
    }
  }
  int M = payoffs.size();
  if (M == 0) {
    for (int i = 0; i < N; i++) cout << amt[i].first << " ";
  } else {
    maximum_payoff.resize(M);
    maximum_payoff[M - 1] = payoffs[M - 1].first;
    for (int i = M - 2; i >= 0; i--)
      maximum_payoff[i] = ((payoffs[i].first) > (maximum_payoff[i + 1])
                               ? (payoffs[i].first)
                               : (maximum_payoff[i + 1]));
    int idx;
    for (int i = 0; i < N; i++) {
      idx = upper_bound(amt[i].second);
      if (idx < M)
        amt[i].first =
            ((amt[i].first) > (maximum_payoff[idx]) ? (amt[i].first)
                                                    : (maximum_payoff[idx]));
      cout << amt[i].first << " ";
    }
  }
  cout << "\n";
  return 0;
}
