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 maxn = 500007;
int ls[maxn * 10], rs[maxn * 10], root[111];
int cnt = 0;
void insert(int &L, int l, int r, int pos) {
  if (L == 0) {
    L = ++cnt;
  }
  if (l == r) return;
  int mid = (l + r) >> 1;
  if (mid >= pos) {
    insert(ls[L], l, mid, pos);
  } else {
    insert(rs[L], mid + 1, r, pos);
  }
}
int merge(int x, int y) {
  if (!x) return y;
  if (!y) return x;
  ls[x] = merge(ls[x], ls[y]);
  rs[x] = merge(rs[x], rs[y]);
  return x;
}
void change(int &L, int &R, int l, int r, int LL, int RR) {
  if (R == 0) return;
  if (LL <= l && RR >= r) {
    L = merge(L, R);
    R = 0;
    return;
  }
  if (!L) L = ++cnt;
  int mid = (l + r) >> 1;
  if (mid >= LL) {
    change(ls[L], ls[R], l, mid, LL, RR);
  }
  if (mid < RR) {
    change(rs[L], rs[R], mid + 1, r, LL, RR);
  }
}
int ans[maxn];
void dfs(int rt, int l, int r, int i) {
  if (rt == 0) return;
  if (l == r) {
    ans[l] = i;
    return;
  }
  int mid = (l + r) >> 1;
  dfs(ls[rt], l, mid, i);
  dfs(rs[rt], mid + 1, r, i);
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    insert(root[x], 1, n, i);
  }
  int m;
  scanf("%d", &m);
  while (m--) {
    int l, r, x, y;
    scanf("%d%d%d%d", &l, &r, &x, &y);
    if (x == y) continue;
    change(root[y], root[x], 1, n, l, r);
  }
  for (int i = 1; i <= 100; i++) dfs(root[i], 1, n, i);
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
}
