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>
using namespace std;
const int N = 2e5 + 5;
const int blk_sz = 800;
int a[N];
int f[blk_sz][105];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, q;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < blk_sz; i++)
    for (int j = 0; j <= 100; j++) f[i][j] = j;
  cin >> q;
  while (q--) {
    int l, r, x, y;
    cin >> l >> r >> x >> y;
    l--;
    while (l < r) {
      if (l % blk_sz == 0 && l + blk_sz <= r) {
        int blk = l / blk_sz;
        for (int i = 0; i <= 100; i++)
          if (f[blk][i] == x) f[blk][i] = y;
        l += blk_sz;
      } else {
        int blk = l / blk_sz;
        int cur = blk * blk_sz;
        for (int i = cur; i < cur + blk_sz && i < n; i++) a[i] = f[blk][a[i]];
        for (int i = 0; i <= 100; i++) f[blk][i] = i;
        while (l < cur + blk_sz && l < r) {
          if (a[l] == x) a[l] = y;
          l++;
        }
      }
    }
  }
  for (int i = 0; i < n; i++) cout << f[i / blk_sz][a[i]] << " ";
  return 0;
}
