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 + 50, M = 6e5 + 50, K = 100;
int qx, qy, a[N], tr[M][K + 1];
int m, n, qs, qt, tag[M];
void build(int v, int l, int r) {
  for (int i = 1; i <= (K); ++i) tr[v][i] = i;
  if (l < r) {
    int mid = (l + r) >> 1;
    build(v << 1, l, mid);
    build(v << 1 ^ 1, mid + 1, r);
  }
}
void down(int v) {
  if (!tag[v]) return;
  for (int i = 1; i <= (K); ++i) {
    tr[v << 1][i] = tr[v][tr[v << 1][i]];
    tr[v << 1 ^ 1][i] = tr[v][tr[v << 1 ^ 1][i]];
  }
  for (int i = 1; i <= (K); ++i) tr[v][i] = i;
  tag[v << 1] = tag[v << 1 ^ 1] = 1, tag[v] = 0;
}
void update(int v, int l, int r) {
  if (r < qs || l > qt)
    return;
  else if (qs <= l && r <= qt) {
    tag[v] = 1;
    for (int i = 1; i <= (K); ++i)
      if (tr[v][i] == qx) tr[v][i] = qy;
    return;
  } else {
    int mid = (l + r) >> 1;
    down(v);
    update(v << 1, l, mid);
    update(v << 1 ^ 1, mid + 1, r);
  }
}
void print(int v, int l, int r) {
  if (l == r)
    printf("%d ", tr[v][a[l]]);
  else {
    int mid = (l + r) >> 1;
    down(v);
    print(v << 1, l, mid);
    print(v << 1 ^ 1, mid + 1, r);
  }
}
int main(int argc, char *argv[]) {
  scanf("%d", &n);
  for (int i = 1; i <= (n); ++i) scanf("%d", a + i);
  build(1, 1, n);
  scanf("%d", &m);
  while (m--) {
    scanf("%d%d%d%d", &qs, &qt, &qx, &qy);
    update(1, 1, n);
  }
  print(1, 1, n);
}
