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 f[2 * (1 << 18) + 17][101];
int a[(1 << 18) + 17];
int n, q;
vector<vector<vector<int>>> events((1 << 18) + 17);
void process(int i, int a, int b) {
  int x = i + (1 << 18);
  f[x][a] = b;
  for (x /= 2; x >= 1; x /= 2)
    for (int i = 1; i <= 100; i++) f[x][i] = f[x * 2 + 1][f[x * 2][i]];
}
int main() {
  for (int x = 2 * (1 << 18) + 1; x >= 1; x--)
    for (int i = 1; i <= 100; i++) f[x][i] = i;
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  cin >> q;
  for (int i = 1; i <= q; i++) {
    int l, r, x, y;
    cin >> l >> r >> x >> y;
    events[l].push_back({i, x, y});
    events[r + 1].push_back({i, x, x});
  }
  for (int i = 1; i <= n; i++) {
    for (vector<int> event : events[i]) process(event[0], event[1], event[2]);
    cout << f[1][a[i]] << " \n"[i == n];
  }
}
