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;
long long int power_mod(long long int a, long long int x) {
  if (x == 0) return 1;
  long long int y = power_mod(a, x / 2);
  long long int ans = (y * y) % 998244353;
  if (x % 2) ans = (ans * a) % 998244353;
  return ans;
}
long long int inv(long long int a) { return power_mod(a, 998244353 - 2); }
long long int power(long long int a, long long int x) {
  if (x == 0) return 1;
  long long int y = power(a, x / 2);
  long long int ans = (y * y);
  if (x % 2) ans *= a;
  return ans;
}
int main() {
  int n;
  cin >> n;
  long long int a[n + 1];
  for (int i = 1; i <= n; i++) cin >> a[i];
  long long int q;
  cin >> q;
  long long int mx = 0;
  vector<pair<long long int, long long int> > f;
  for (int i = 0; i < q; i++) {
    long long int t;
    cin >> t;
    if (t == 1) {
      long long int x, p;
      cin >> p >> x;
      f.push_back({p, x});
    } else {
      long long int x;
      cin >> x;
      f.push_back({x, -1});
    }
  }
  reverse(f.begin(), f.end());
  int vis[n + 1];
  memset(vis, 0, sizeof(vis));
  for (int i = 0; i < q; i++) {
    if (f[i].second == -1)
      mx = max(mx, f[i].first);
    else {
      if (vis[f[i].first] == 0) {
        a[f[i].first] = max(mx, f[i].second);
        vis[f[i].first] = 1;
      }
    }
  }
  for (int i = 1; i <= n; i++)
    if (vis[i] == 0) {
      cout << max(mx, a[i]) << " ";
    } else {
      cout << a[i] << " ";
    }
  cout << endl;
}
