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;
class Segm_Tree {
 public:
  Segm_Tree() {
    cin >> n;
    val.resize(n + 1);
    tree.resize(n << 2);
    lazy.resize(n << 2);
    for (auto &x : tree) {
      x.resize(101);
      for (int i = 1; i <= 100; ++i) {
        x[i] = i;
      }
    }
    for (int i = 1; i <= n; ++i) {
      cin >> val[i];
    }
  }
  void Solve() {
    int q, l, r, x, y;
    cin >> q;
    while (q--) {
      cin >> l >> r >> x >> y;
      Update(l, r, x, y, 1, n, 1);
    }
    Finish(1, n, 1);
  }

 private:
  int n, q;
  vector<int> val;
  vector<bool> lazy;
  vector<vector<int> > tree;
  void Propagate(int cur_node) {
    int left = cur_node << 1;
    int right = left | 1;
    for (int i = 1; i <= 100; ++i) {
      tree[left][i] = tree[cur_node][tree[left][i]];
      tree[right][i] = tree[cur_node][tree[right][i]];
    }
    for (int i = 1; i <= 100; ++i) {
      tree[cur_node][i] = i;
    }
    lazy[left] = true;
    lazy[right] = true;
    lazy[cur_node] = false;
  }
  void Update(int l, int r, int x, int y, int st, int dr, int cur_node) {
    if (l <= st and dr <= r) {
      for (int i = 1; i <= 100; ++i) {
        if (tree[cur_node][i] == x) {
          tree[cur_node][i] = y;
        }
      }
      lazy[cur_node] = true;
      if (st != dr and lazy[cur_node]) {
        Propagate(cur_node);
      }
      return;
    }
    if (lazy[cur_node]) {
      Propagate(cur_node);
    }
    int mid = (st + dr) >> 1;
    int left = cur_node << 1;
    int right = left | 1;
    if (l <= mid) {
      Update(l, r, x, y, st, mid, left);
    }
    if (mid + 1 <= r) {
      Update(l, r, x, y, mid + 1, dr, right);
    }
  }
  void Finish(int st, int dr, int cur_node) {
    if (st == dr) {
      cout << tree[cur_node][val[st]] << ' ';
      return;
    }
    if (lazy[cur_node]) {
      Propagate(cur_node);
    }
    int mid = (st + dr) >> 1;
    int left = cur_node << 1;
    int right = left | 1;
    Finish(st, mid, left);
    Finish(mid + 1, dr, right);
  }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  Segm_Tree T;
  T.Solve();
}
