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>
int dx[4] = {0, -1, 0, 1};
int dy[4] = {1, 0, -1, 0};
using namespace std;
class pa3 {
 public:
  int x, y, z;
  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    return z < p.z;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    return z > p.z;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};
class pa4 {
 public:
  double x;
  int y, z, w;
  pa4(double x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    if (z != p.z) return z < p.z;
    return w < p.w;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    if (z != p.z) return z > p.z;
    return w > p.w;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
 public:
  int x, y;
  pa2(int x = 0, int y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator>(const pa2 &p) const { return x != p.x ? x > p.x : y > p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};
class Point {
 public:
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}
  Point operator+(Point p) { return Point(x + p.x, y + p.y); }
  Point operator-(Point p) { return Point(x - p.x, y - p.y); }
  Point operator*(double a) { return Point(x * a, y * a); }
  Point operator/(double a) { return Point(x / a, y / a); }
  double absv() { return sqrt(norm()); }
  double norm() { return x * x + y * y; }
  bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const Point &p) const {
    return fabs(x - p.x) < (1e-7) && fabs(y - p.y) < (1e-7);
  }
};
struct Segment {
  Point p1, p2;
};
double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
bool parareru(Point a, Point b, Point c, Point d) {
  return abs(cross(a - b, d - c)) < (1e-7);
}
double distance_ls_p(Point a, Point b, Point c) {
  if (dot(b - a, c - a) < (1e-7)) return (c - a).absv();
  if (dot(a - b, c - b) < (1e-7)) return (c - b).absv();
  return abs(cross(b - a, c - a)) / (b - a).absv();
}
bool is_intersected_ls(Segment a, Segment b) {
  if (a.p1 == b.p1 || a.p2 == b.p1 || a.p1 == b.p2 || a.p2 == b.p2)
    return false;
  if (parareru((a.p2), (a.p1), (a.p1), (b.p2)) &&
      parareru((a.p2), (a.p1), (a.p1), (b.p1))) {
    if (dot(a.p1 - b.p1, a.p1 - b.p2) < (1e-7)) return true;
    if (dot(a.p2 - b.p1, a.p2 - b.p2) < (1e-7)) return true;
    if (dot(a.p1 - b.p1, a.p2 - b.p1) < (1e-7)) return true;
    if (dot(a.p1 - b.p2, a.p2 - b.p2) < (1e-7)) return true;
    return false;
  } else
    return (cross(a.p2 - a.p1, b.p1 - a.p1) * cross(a.p2 - a.p1, b.p2 - a.p1) <
            (1e-7)) &&
           (cross(b.p2 - b.p1, a.p1 - b.p1) * cross(b.p2 - b.p1, a.p2 - b.p1) <
            (1e-7));
}
double segment_dis(Segment a, Segment b) {
  if (is_intersected_ls(a, b)) return 0;
  double r = distance_ls_p(a.p1, a.p2, b.p1);
  r = min(r, distance_ls_p(a.p1, a.p2, b.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p1));
  return r;
}
Point intersection_ls(Segment a, Segment b) {
  Point ba = b.p2 - b.p1;
  double d1 = abs(cross(ba, a.p1 - b.p1));
  double d2 = abs(cross(ba, a.p2 - b.p1));
  double t = d1 / (d1 + d2);
  return a.p1 + (a.p2 - a.p1) * t;
}
string itos(int i) {
  ostringstream s;
  s << i;
  return s.str();
}
int gcd(int v, int b) {
  if (v > b) return gcd(b, v);
  if (v == b) return b;
  if (b % v == 0) return v;
  return gcd(v, b % v);
}
double distans(double x1, double y1, double x2, double y2) {
  double rr = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
  return sqrt(rr);
}
int beki(int wa, int rr, int warukazu) {
  if (rr == 0) return 1ll;
  if (rr == 1) return wa % warukazu;
  if (rr % 2 == 1) return (beki(wa, rr - 1, warukazu) * wa) % warukazu;
  int zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}
int par[450][101], ranks[450][101], kosuu[450][101], ban[450][101],
    gyaku[450][101];
void shoki(int ww, int nn) {
  for (int i = 0; i <= nn; i++) {
    par[ww][i] = i;
    ranks[ww][i] = 0;
    kosuu[ww][i] = 1;
    ban[ww][i] = i;
    gyaku[ww][i] = i;
  }
}
int root(int ww, int x) {
  return par[ww][x] == x ? x : par[ww][x] = root(ww, par[ww][x]);
}
bool same(int ww, int x, int y) { return root(ww, x) == root(ww, y); }
void unite(int ww, int x, int y) {
  x = root(ww, x);
  y = root(ww, y);
  int xx = kosuu[ww][x], yy = kosuu[ww][y];
  if (x == y) return;
  if (ranks[ww][x] < ranks[ww][y]) {
    par[ww][x] = y;
    kosuu[ww][y] = yy + xx;
  } else {
    par[ww][y] = x;
    if (ranks[ww][x] == ranks[ww][y]) ranks[ww][x] = ranks[ww][x] + 1;
    kosuu[ww][x] = yy + xx;
  }
  return;
}
int a[448 * 448] = {0};
int w[448][101];
int er = 448;
int n;
void totonoe(int r) {
  for (int i = er * r; i < er * (r + 1); i++) {
    a[i] = gyaku[r][root(r, a[i])];
    if (a[i] == -1) {
      cout << "ha??" << endl;
      exit(1);
    }
  }
  shoki(r, 100);
}
void totonoell(int r) {
  for (int i = er * r; i < er * (r + 1); i++) {
    a[i] = gyaku[r][root(r, a[i])];
  }
}
void yaruzo(int l, int r, int x, int y) {
  int hb = l / er;
  int mb = r / er;
  if (hb == mb) {
    totonoe(hb);
    for (int i = l; i <= r; i++)
      if (a[i] == x) a[i] = y;
    return;
  }
  totonoe(hb);
  totonoe(mb);
  for (int i = l; i < (hb + 1) * er; i++)
    if (a[i] == x) a[i] = y;
  for (int i = mb * er; i <= r; i++)
    if (a[i] == x) a[i] = y;
  for (int i = hb + 1; i < mb; i++) {
    if (ban[i][x] == -1) {
      continue;
    }
    if (ban[i][y] == -1) {
      ban[i][y] = ban[i][x];
      gyaku[i][ban[i][y]] = y;
      ban[i][x] = -1;
      continue;
    }
    unite(i, ban[i][y], ban[i][x]);
    ban[i][y] = root(i, ban[i][y]);
    ban[i][x] = -1;
    gyaku[i][ban[i][y]] = y;
  }
}
signed main() {
  for (int j = 0; j < er; j++) {
    for (int i = 0; i <= 100; i++) w[j][i] = i;
    shoki(j, 100);
  }
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  int q;
  scanf("%d", &q);
  for (int i = 0; i < q; i++) {
    int l, r, x, y;
    scanf("%d%d%d%d", &l, &r, &x, &y);
    l--;
    r--;
    if (x != y) yaruzo(l, r, x, y);
  }
  for (int i = 0; i < er; i++) totonoell(i);
  for (int i = 0; i < n; i++) printf("%d ", a[i]);
  printf("\n");
  return 0;
}
