#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

using namespace __gnu_pbds;
using TP = tree<pair<ll, int>, null_type, less<pair<ll, int>>, rb_tree_tag, tree_order_statistics_node_update>;
using TI = tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  VL a(n);
  rep(i, n) cin >> a[i];
  TI updated;
  rep(i, n) updated.insert(i);
  // (value, id)
  int id_nxt = 0;
  TP sorted;
  rep(_, q) {
    int op;
    cin >> op;
    if (op == 1) {
      int k;
      ll x;
      cin >> k >> x;
      k--;
      auto [it, inserted] = updated.insert(k);
      if (inserted) {
        int smaller = updated.order_of_key(k);
        sorted.erase(sorted.find_by_order(k - smaller));
      }
      a[k] = x;
    } else if (op == 2) {
      for (int i : updated) {
        sorted.insert({a[i], id_nxt++});
      }
      updated.clear();
    } else {
      int k;
      cin >> k;
      k--;
      auto it = updated.lower_bound(k);
      if (it != updated.end() && *it == k) {
        cout << a[k] << '\n';
      } else {
        int smaller = updated.order_of_key(k);
        cout << sorted.find_by_order(k - smaller)->first << '\n';
      }
    }
  }
}