#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

ll op(ll a, ll b) { return a + b; }

ll e() { return 0LL; }

ll target;

bool f(ll x) { return x < target; }

int main() {
    ll N, Q;
    cin >> N >> Q;
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    vector<ll> t(Q, -1);
    vector<ll> k(Q, -1);
    vector<ll> x(Q, -1);
    // 昇順クエリが流れてきた時点でリセットする方針にすれば良いのでは
    for (ll i = 0; i < Q; i++) {
        cin >> t[i];
        if (t[i] == 1) {
            cin >> k[i] >> x[i];
            k[i]--;
        } else if (t[i] == 3) {
            cin >> k[i];
            k[i]--;
        }
    }
    map<ll, ll> mp1;
    for (ll i = 0; i < N; i++) {
        mp1[A[i]]++;
    }
    for (ll i = 0; i < Q; i++) {
        if (x[i] != -1) {
            mp1[x[i]]++;
        }
    }
    vector<ll> reversed(0);
    ll now = 0;
    for (auto it = mp1.begin(); it != mp1.end(); it++) {
        it->second = now;
        reversed.push_back(it->first);
        now++;
    }
    // debug(reversed);
    // segtree で値の個数を管理しておく
    segtree<ll, op, e> seg(now);
    for (ll i = 0; i < N; i++) {
        seg.set(mp1[A[i]], seg.get(mp1[A[i]]) + 1);
    }
    // map を使って更新が起こった値を管理
    map<ll, ll> mp2;
    for (ll i = 0; i < N; i++) {
        mp2[i] = A[i];
    }

    // これ以降、セグ木への更新は遅延的に伝搬させていく
    ll prev = -1;
    for (ll i = 0; i < Q; i++) {
        if (t[i] == 1) {
            mp2[k[i]] = x[i];
        } else if (t[i] == 2) {
            if (prev == -1) {
                for (auto it = mp2.begin(); it != mp2.end(); it++) {
                    seg.set(mp1[A[it->first]], seg.get(mp1[A[it->first]]) - 1);
                    seg.set(mp1[it->second], seg.get(mp1[it->second]) + 1);
                }
            } else {
                for (auto it = mp2.begin(); it != mp2.end(); it++) {
                    target = it->first + 1;
                    ll idx = seg.max_right<f>(0);
                    seg.set(idx, seg.get(idx) - 1);
                    seg.set(mp1[it->second], seg.get(mp1[it->second]) + 1);
                }
            }
            mp2.clear();
            prev = i;
        } else {
            if (mp2.find(k[i]) != mp2.end()) {
                cout << mp2[k[i]] << endl;
            } else {
                target = k[i] + 1;
                ll idx = seg.max_right<f>(0);
                cout << reversed[idx] << endl;
            }
        }
    }
}