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;
int tot;
const int N = 2e5 + 10;
struct node {
  int l, r;
} t[N * 30];
int root[105], ans[N];
void update(int &o, int l, int r, int pos) {
  if (!o) o = ++tot;
  if (l == r) return;
  int mid = l + r >> 1;
  if (pos <= mid)
    update(t[o].l, l, mid, pos);
  else
    update(t[o].r, mid + 1, r, pos);
}
int merge(int x, int y) {
  if (!x || !y) return x + y;
  t[x].l = merge(t[x].l, t[y].l);
  t[x].r = merge(t[x].r, t[y].r);
  return x;
}
void modify(int &d, int &p, int l, int r, int L, int R) {
  if (!d) return;
  if (L <= l && R >= r) {
    p = merge(d, p);
    d = 0;
    return;
  }
  if (!p) p = ++tot;
  int mid = (l + r) / 2;
  if (L <= mid) modify(t[d].l, t[p].l, l, mid, L, R);
  if (R > mid) modify(t[d].r, t[p].r, mid + 1, r, L, R);
}
void query(int o, int l, int r, int val) {
  if (!o) return;
  if (l == r) {
    ans[l] = val;
    return;
  }
  int mid = l + r >> 1;
  query(t[o].l, l, mid, val);
  query(t[o].r, mid + 1, r, val);
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int val;
    scanf("%d", &val);
    update(root[val], 1, n, i);
  }
  int m;
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    int l, r, x, y;
    scanf("%d%d%d%d", &l, &r, &x, &y);
    if (x != y) modify(root[x], root[y], 1, n, l, r);
  }
  for (int i = 1; i <= 100; i++) query(root[i], 1, n, i);
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  return 0;
}
