#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using S = ll;
S op(S a, S b){ return a + b; }
S e(){ return 0ll; }
S target;
bool g(S x){ return x < target; }

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);

    int N, Q; cin >> N >> Q;
    vector<ll> A(N);
    rep(i, N) cin >> A[i];
    vector<ll> Z = A;
    Z.push_back(-LINF);

    vector<int> f(Q), k(Q);
    vector<ll> x(Q);
    rep(i, Q){
        cin >> f[i];
        if(f[i] == 1){
            cin >> k[i] >> x[i];
            k[i]--;
            Z.push_back(x[i]);
        }
        if(f[i] == 2)
        if(f[i] == 3){
            cin >> k[i];
            k[i]--;
        }
    }

    sort(all(Z));
    Z.erase(unique(all(Z)), Z.end());
    int L = Z.size();
    segtree<S, op, e> seg(L);
    rep(i, N) {
        A[i] = lower_bound(all(Z), A[i]) - Z.begin();
        seg.set(A[i], seg.get(A[i]) + 1);
    }

    vector<int> lazy;
    vector<int> B(N);
    rep(i, N) {
        B[i] = A[i];
        lazy.push_back(i);
    }

    rep(i, Q){
        debug(i, lazy, B);
        if(f[i] == 1){
            lazy.push_back(k[i]);
            B[k[i]] = lower_bound(all(Z), x[i]) - Z.begin();
        }
        if(f[i] == 2){
            sort(all(lazy));
            lazy.erase(unique(all(lazy)), lazy.end());
            reverse(all(lazy));

            for(auto &l : lazy){
                target = l + 1;
                debug(target);
                int r = seg.max_right<g>(0);
                debug(target, r);
                seg.set(r, seg.get(r) - 1);
            }

            for(auto &l : lazy){
                seg.set(B[l], seg.get(B[l]) + 1);
                B[l] = -1;
            }
            lazy.clear();
        }
        if(f[i] == 3){
            if(B[i] != -1){
                cout << Z[B[k[i]]] << endl;
            }
            else{
                target = k[i] + 1;
                int k = seg.max_right<g>(0);
                cout << Z[k] << endl;
            }
        }
    }
}