#include <bits/stdc++.h>
using namespace std;
#define int long long
struct SEG{
private:
    int n;
    unordered_map<int,int> m;
public:
    SEG(){
        n = (1ll<<60);
    }
    void add(int a, int w) {
        for (int x = a; x < n; x |= x + 1) {
            m[x] += w;
        }
    }
    int f(int k){
        k--;
        int l = 0, now = (1ll<<59)-1, s = 0;
        for(int i=58;i>=0;i--){
            if(s+m[now] <= k){
                s += m[now];
                l += (1ll<<(i+1));
                now += (1ll<<(i+1));
            }
            now -= (1ll<<i);
        }
        if(s+m[now] <= k) l++;
        return l;
    }
};
signed main(){
    int N,Q;
    cin>>N>>Q;
    vector<int> A(N);
    for(int i=0;i<N;i++) cin>>A[i];
    while(Q--){
        int t;
        cin>>t;
        if(t == 1){
            int a,b;
            cin>>a>>b;
            A[a-1] = b;
        }
        else if(t == 2){
            sort(A.begin(),A.end());
            break;
        }
        else{
            int a;
            cin>>a;
            cout<<A[a-1]<<endl;
        }
    }
    SEG seg;
    unordered_map<int,int> m;
    for(int i=0;i<N;i++) seg.add(A[i],1);
    while(Q--){
        int t;
        cin>>t;
        if(t == 1){
            int a,b;
            cin>>a>>b;
            m[a-1] = b;
        }
        else if(t == 2){
            unordered_map<int,int> mm;
            for(auto [a,b]:m){
                seg.add(A[a],-1);
                seg.add(b,1);
                A[a] = b;
            }
            m = mm;
        }
        else{
            int a;
            cin>>a;
            if(m.count(a-1)) cout<<m[a-1]<<endl;
            else cout<<seg.f(a)<<endl;
        }
    }
}