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;
bool sortbysec(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.second < b.second);
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long min(long long a, long long b) { return a < b ? a : b; }
long long max(long long a, long long b) { return a > b ? a : b; }
int32_t main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  clock_t startTime = clock();
  long long n;
  cin >> n;
  vector<long long> v(n);
  for (long long i = 0; i < n; i++) cin >> v[i];
  long long q;
  cin >> q;
  vector<long long> ma(q + 5);
  ma[0] = 0;
  long long i = 0;
  map<long long, long long> m, ii;
  vector<long long> rev;
  for (long long h = 0; h < q; h++) {
    long long x;
    cin >> x;
    if (x == 2) {
      long long c;
      cin >> c;
      rev.push_back(c);
    }
    if (x == 1) {
      rev.push_back(0);
      long long ind;
      cin >> ind;
      ind--;
      long long val;
      cin >> val;
      m[ind] = val;
      ii[ind] = i;
      v[ind] = val;
    }
    i++;
  }
  reverse((rev).begin(), (rev).end());
  for (long long i = 0; i < q; i++) {
    ma[i + 1] = max(rev[i], ma[i]);
  }
  reverse((ma).begin(), (ma).end());
  vector<long long> x(q);
  for (long long i = 0; i < q; i++) {
    x[i] = ma[ma.size() - 2 - i];
  }
  reverse((x).begin(), (x).end());
  for (long long i = 0; i < n; i++)
    cout << max(max(m[i], x[ii[i]]), v[i]) << " ";
}
