You are given an array a consisting of n integers. You have to process q queries to this array; each query is given as four numbers l, r, x and y, denoting that for every i such that l ≤ i ≤ r and ai = x you have to set ai equal to y.

Print the array after all queries are processed.

Input

The first line contains one integer n (1 ≤ n ≤ 200000) — the size of array a.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 100) — the elements of array a.

The third line contains one integer q (1 ≤ q ≤ 200000) — the number of queries you have to process.

Then q lines follow. i-th line contains four integers l, r, x and y denoting i-th query (1 ≤ l ≤ r ≤ n, 1 ≤ x, y ≤ 100).

Output

Print n integers — elements of array a after all changes are made.

Example

Input

5
1 2 3 4 5
3
3 5 3 5
1 5 5 1
1 5 1 5


Output

5 2 5 4 5 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, q;
  uint16_t A;
  cin >> n;
  array<uint8_t, 200000> a;
  for (int i = 0; i < n; ++i) {
    cin >> A;
    a[i] = (uint8_t)A;
  }
  int l, r;
  uint8_t x, y;
  uint16_t X, Y;
  cin >> q;
  while (q--) {
    cin >> l >> r >> X >> Y;
    x = (uint8_t)X;
    y = (uint8_t)Y;
    for (int i = l - 1; i < r; ++i) {
      if (a[i] == x) {
        a[i] = y;
      }
    }
  }
  for (int i = 0; i < n; ++i) {
    cout << (uint16_t)a[i] << ' ';
  }
}
