#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

#include <atcoder/fenwicktree>
#include <atcoder/segtree>

using ll = long long;

using namespace std;

int op(int l, int r) { return l + r; }

int e() { return 0; }

int target;

bool f(int x) { return x <= target; }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    int N, Q;
    cin >> N >> Q;
    vector<ll> A(N);
    cin >> A;
    vector<int> t(Q), k(Q);
    vector<ll> x(Q);
    for (int i = 0; i < Q; i++) {
        cin >> t[i];
        if (t[i] == 1) {
            cin >> k[i] >> x[i];
            k[i]--;
        } else if (t[i] == 2) {
        } else {
            cin >> k[i];
            k[i]--;
        }
    }

    vector<ll> cand = A;
    for (int i = 0; i < Q; i++) {
        if (t[i] == 1) {
            cand.emplace_back(x[i]);
        }
    }
    mkuni(cand);
    int len = cand.size();
    atcoder::segtree<int, op, e> seg(len);
    atcoder::fenwick_tree<int> ft(N);
    map<int, ll> update;
    for (int i = 0; i < N; i++) {
        update[i] = A[i];
        ft.add(i, 1);
    }
    auto query = [&](int i) -> ll {
        if (update.count(i)) return update[i];
        target = i - ft.sum(0, i);
        return cand[seg.max_right<f>(0)];
    };
    for (int i = 0; i < Q; i++) {
        if (t[i] == 1) {
            if (not update.count(k[i])) {
                ll cur = query(k[i]);
                int pos = lwb(cand, cur);
                seg.set(pos, seg.get(pos) - 1);
                ft.add(k[i], 1);
            }
            update[k[i]] = x[i];
        } else if (t[i] == 2) {
            for (auto [key, val] : update) {
                seg.set(lwb(cand, val), 1);
                ft.add(key, -1);
            }
            update.clear();
        } else {
            cout << query(k[i]) << "\n";
        }
    }
    return 0;
}