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 N = 2e5 + 5;
char st[4 * N][100];
bool lz[4 * N];
int v[N];
void build(int n, int l, int r) {
  for (int i = 1; i <= 100; i++) st[n][i] = i;
  int mid = (l + r) / 2;
  if (l != r) build(2 * n, l, mid), build(2 * n + 1, mid + 1, r);
}
void push(int n, int l, int r) {
  if (!lz[n] or l == r) return;
  for (int i = 1; i <= 100; i++)
    st[2 * n][i] = st[n][st[2 * n][i]],
           st[2 * n + 1][i] = st[n][st[2 * n + 1][i]];
  lz[2 * n] = lz[2 * n + 1] = 1;
  for (int i = 1; i <= 100; i++) st[n][i] = i;
  lz[n] = 0;
}
void update(int n, int l, int r, int i, int j, int x, int y) {
  if (i > r or j < l) return;
  if (l >= i and r <= j) {
    for (int i = 1; i <= 100; i++)
      if (st[n][i] == x) st[n][i] = y;
    lz[n] = true;
    return;
  }
  push(n, l, r);
  int mid = (l + r) / 2;
  update(2 * n, l, mid, i, j, x, y);
  update(2 * n + 1, mid + 1, r, i, j, x, y);
}
void print(int n, int l, int r) {
  push(n, l, r);
  int mid = (l + r) / 2;
  if (l == r)
    printf("%d ", st[n][v[l]]);
  else
    print(2 * n, l, mid), print(2 * n + 1, mid + 1, r);
}
int main() {
  int n, q;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &v[i]);
  build(1, 1, n);
  scanf("%d", &q);
  for (int i = 0; i < q; i++) {
    int l, r, x, y;
    scanf("%d%d%d%d", &l, &r, &x, &y);
    update(1, 1, n, l, r, x, y);
  }
  print(1, 1, n);
  printf("\n");
  return 0;
}
