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("inline")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
const int N = 200005;
int n, m, tot, a[N], Rt[105];
int lc[N << 5], rc[N << 5];
void Add(int &t, int l, int r, int x) {
  if (!t) t = ++tot;
  int md = (l + r) >> 1;
  if (l == r) return;
  if (x <= md)
    Add(lc[t], l, md, x);
  else
    Add(rc[t], md + 1, r, x);
}
int Merge(int x, int y) {
  if (!x || !y) return x + y;
  lc[x] = Merge(lc[x], lc[y]);
  rc[x] = Merge(rc[x], rc[y]);
  return x;
}
void Modify(int &t, int &lt, int l, int r, int L, int R) {
  if (!lt) return;
  if (L <= l && r <= R) {
    t = Merge(t, lt);
    lt = 0;
    return;
  }
  if (!t) t = ++tot;
  int md = (l + r) >> 1;
  if (L <= md) Modify(lc[t], lc[lt], l, md, L, R);
  if (md < R) Modify(rc[t], rc[lt], md + 1, r, L, R);
}
void Work(int t, int l, int r, int v) {
  if (!t) return;
  if (l == r) return void(a[l] = v);
  int md = (l + r) >> 1;
  Work(lc[t], l, md, v);
  Work(rc[t], md + 1, r, v);
}
int main() {
  scanf("%d", &n);
  for (int i = 1, x; i <= n; ++i) {
    scanf("%d", &x);
    Add(Rt[x], 1, n, i);
  }
  scanf("%d", &m);
  for (int l, r, x, y; m; --m) {
    scanf("%d%d%d%d", &l, &r, &x, &y);
    if (x == y) continue;
    Modify(Rt[y], Rt[x], 1, n, l, r);
  }
  for (int i = 1; i <= 100; ++i) Work(Rt[i], 1, n, i);
  for (int i = 1; i <= n; ++i) printf("%d ", a[i]);
  return 0;
}
