#include <algorithm>
#include <atcoder/lazysegtree.hpp>
#include <atcoder/segtree.hpp>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using i8 = int8_t;
using i32 = int;
using i64 = long long;
// using i128 = __int128;
using u64 = unsigned long long;
using ll = long long;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  _main();
}

i64 pow(i64 j, i64 n) {
  i64 res = 1;
  while (n > 0) {
    if (n & 1)
      res *= j;
    j *= j;
    n >>= 1;
  }
  return res;
}

i64 op(i64 a, i64 b) { return a + b; }
i64 e() { return 0; }
i64 m(i64 f, i64 x) { return x + f; }
i64 comp(i64 f, i64 g) { return f + g; }

i64 n, q;
void _main() {
  cin >> n >> q;
  vector<pair<i64, i64>> vs;
  vector<i64> a(n);
  for (i64 i = 0; i < n; i++) {
    cin >> a[i];
    vs.push_back({a[i], i});
    vs.push_back({0, i});
  }
  vector<tuple<i64, i64, i64>> query(q);
  for (i64 i = 0; i < q; i++) {
    i64 op, k, x;
    cin >> op;
    if (op == 1) {
      cin >> k >> x;
      vs.push_back({x, n + i});
    } else if (op == 3) {
      cin >> k;
    }
    k--;
    query[i] = {op, k, x};
  }
  sort(vs.begin(), vs.end());
  atcoder::segtree<i64, op, e> seg(vs.size());
  vector<i64> update(vs.size());
  set<i64> bk;
  for (i64 i = 0; i < n; i++) {
    seg.set(i, 1);
    i64 j = lower_bound(vs.begin(), vs.end(), make_pair(a[i], i)) - vs.begin();
    update[i] = j;
    bk.insert(i);
  }
  for (i64 i = 0; i < q; i++) {
    i64 op = get<0>(query[i]);
    i64 k = get<1>(query[i]);
    i64 x = get<2>(query[i]);
    if (op == 1) {
      i64 j =
          lower_bound(vs.begin(), vs.end(), make_pair(x, n + i)) - vs.begin();
      i64 p = seg.max_right(0, [&](i64 a) { return a <= k; });
      update[p] = j;
      bk.insert(p);
    } else if (op == 2) {
      for (auto j : bk) {
        seg.set(j, seg.get(j) - 1);
        seg.set(update[j], seg.get(update[j]) + 1);
        update[j] = 0;
      }
    } else {
      i64 p = seg.max_right(0, [&](i64 a) { return a <= k; });
      i64 ans = vs[p].first;
      cout << ans << "\n";
    }
  }
}