#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define pb emplace_back
#define sz(a) int(a.size())

const int N = 5e5 + 5;
int n, m, q, a[N], l[N], r[N], qid, fa[N], val[N];
int ql[N], qr[N];

int getf(int x) {
  return x == fa[x] ? x : fa[x] = getf(fa[x]);
}
inline int merge(int x, int y) {
  if (!x || !y) {
    return x + y;
  }
  fa[x] = y;
  return y;
}

pair<int, int> oper[N];
vector<pair<int, int>> vecr[N];
vector<int> vecl[N];

set<pair<int, int>> S;

#define mid ((L + R) >> 1)
#define Ls rt << 1, L, mid
#define Rs rt << 1 | 1, mid + 1, R

int tr[N << 2];
void upd(int p, int v, int rt = 1, int L = 1, int R = n) {
  if (L == R) {
    tr[rt] = v;
    return ;
  }
  p <= mid ? upd(p, v, Ls) : upd(p, v, Rs);
  tr[rt] = max(tr[rt << 1], tr[rt << 1 | 1]);
}
int qry(int l, int r, int rt = 1, int L = 1, int R = n) {
  if (l <= L && R <= r) {
    return tr[rt];
  }
  int res = 0;
  if (l <= mid) {
    res = max(res, qry(l, r, Ls));
  }
  if (r > mid) {
    res = max(res, qry(l, r, Rs));
  }
  return res;
}
void build(int rt = 1, int L = 1, int R = n) {
  if (L == R) {
    tr[rt] = a[L];
    return ;
  }
  build(Ls), build(Rs), tr[rt] = max(tr[rt << 1], tr[rt << 1 | 1]);
}

#undef mid
#undef Ls
#undef Rs

signed main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m >> q;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  for (int i = 1; i <= m; ++i) {
    cin >> l[i] >> r[i];
  }
  for (int i = 1; i <= q; ++i) {
    int op, x, y, z;
    cin >> op;
    if (op == 1) {
      cin >> x >> y;
      oper[i] = make_pair(x, y);
    }else {
      cin >> x >> y >> z; 
      if (x <= y) {
        vecr[y].pb(z, ++qid);
        vecl[x].pb(qid);
        oper[i] = make_pair(qid, 0);
      }else {
        oper[i] = make_pair(-z, 0);
      }
    }
  }
  for (auto o : {0, 1}) {
    iota(fa, fa + 1 + qid, 0);
    for (int i = m; i; --i) {
      for (auto t : vecr[i]) {
        int k = t.first, v = t.second;
        S.emplace(k, v), val[v] = k;
      }
      auto itl = S.lower_bound(make_pair(l[i], 0));
      auto itr = itl;
      int f = 0;
      for (; itr != S.end() && itr->first <= r[i]; ++itr) {
        f = merge(f, itr->second);
      }
      S.erase(itl, itr), S.emplace(o ? l[i] : r[i], f), val[f] = o ? l[i] : r[i];
      for (auto v : vecl[i]) {
        (o ? ql[v] : qr[v]) = val[getf(v)];
      }
    }
    S.clear();
  }
  build();
  for (int i = 1; i <= q; ++i) {
    int x = oper[i].first, y = oper[i].second;
    if (y) {
      upd(x, y);
    }else {
      if (x < 0) {
        cout << qry(-x, -x) << '\n';
      }else {
        cout << qry(ql[x], qr[x]) << '\n';
      }
    }
  }
  return 0;
}