#include <bits/stdc++.h>
using namespace std;
class Segm_Tree {
 public:
  Segm_Tree() {
    cin >> n;
    val.resize(n + 1);
    tree.resize(n << 2);
    lazy.resize(n << 2);
    for (auto &x : tree) {
      x.resize(101);
      for (int i = 1; i <= 100; ++i) {
        x[i] = i;
      }
    }
    for (int i = 1; i <= n; ++i) {
      cin >> val[i];
    }
  }
  void Solve() {
    int q, l, r, x, y;
    cin >> q;
    while (q--) {
      cin >> l >> r >> x >> y;
      Update(l, r, x, y, 1, n, 1);
    }
    Finish(1, n, 1);
  }

 private:
  int n, q;
  vector<int> val;
  vector<bool> lazy;
  vector<vector<int> > tree;
  void Propagate(int cur_node) {
    int left = cur_node << 1;
    int right = left | 1;
    for (int i = 1; i <= 100; ++i) {
      tree[left][i] = tree[cur_node][tree[left][i]];
      tree[right][i] = tree[cur_node][tree[right][i]];
    }
    for (int i = 1; i <= 100; ++i) {
      tree[cur_node][i] = i;
    }
    lazy[left] = true;
    lazy[right] = true;
    lazy[cur_node] = false;
  }
  void Update(int l, int r, int x, int y, int st, int dr, int cur_node) {
    if (l <= st and dr <= r) {
      for (int i = 1; i <= 100; ++i) {
        if (tree[cur_node][i] == x) {
          tree[cur_node][i] = y;
        }
      }
      lazy[cur_node] = true;
      if (st != dr and lazy[cur_node]) {
        Propagate(cur_node);
      }
      return;
    }
    if (lazy[cur_node]) {
      Propagate(cur_node);
    }
    int mid = (st + dr) >> 1;
    int left = cur_node << 1;
    int right = left | 1;
    if (l <= mid) {
      Update(l, r, x, y, st, mid, left);
    }
    if (mid + 1 <= r) {
      Update(l, r, x, y, mid + 1, dr, right);
    }
  }
  void Finish(int st, int dr, int cur_node) {
    if (st == dr) {
      cout << tree[cur_node][val[st]] << ' ';
      return;
    }
    if (lazy[cur_node]) {
      Propagate(cur_node);
    }
    int mid = (st + dr) >> 1;
    int left = cur_node << 1;
    int right = left | 1;
    Finish(st, mid, left);
    Finish(mid + 1, dr, right);
  }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  Segm_Tree T;
  T.Solve();
}
