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 target("avx,avx2,fma")
alignas(64) char a[200200];
void replace(char *__restrict ptr, const int len, const char x, const char y) {
  for (int i = 0; i < len; i++) ptr[i] = ptr[i] == x ? y : ptr[i];
}
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(0);
  int n;
  std::cin >> n;
  for (int i = 0, v; i < n; i++) {
    std::cin >> v;
    a[i] = v;
  }
  int q;
  std::cin >> q;
  struct Query {
    int l, r;
    char x, y;
  };
  std::vector<Query> queries(q);
  for (int i = 0; i < q; i++) {
    int l, r, oldValue, newValue;
    std::cin >> l >> r >> oldValue >> newValue;
    queries[i] = Query{l - 1, r, (char)oldValue, (char)newValue};
  }
  const int gsize = 4096;
  for (int g = 0; g * gsize < n; g++) {
    const int begin = g * gsize;
    const int after = std::min(n, begin + gsize);
    for (const auto &it : queries) {
      if (it.r <= begin || after <= it.l) continue;
      int min = std::max(it.l, begin);
      int max = std::min(it.r, after);
      replace(a + min, max - min, it.x, it.y);
    }
  }
  for (int i = 0; i < n; i++) {
    std::cout << (int)a[i] << ' ';
  }
  std::cout << std::endl;
}
