#include<bits/stdc++.h>
using namespace std;

struct Fenwick_tree{
	private:
	uint_fast32_t siz=1;
	uint_fast32_t d=1;
	vector<int_fast32_t> dat;
	public:
	Fenwick_tree(int_fast32_t N) : dat(N,0){
		siz=N;
		d=bit_floor(siz-1);
	}
	void add(int_fast32_t k,int_fast32_t x){
		for(int_fast32_t i=k;i<siz;i+=((i+1)&(-i-1))){
			dat[i]+=x;
		}
	}
	int_fast32_t max_right(int_fast32_t x){
		int_fast32_t ans=0;
		int_fast32_t res=0;
		for(uint_fast32_t h=d;h>0;h/=2){
			if(ans+h<=siz){
				if(res+dat[ans+h-1]<=x){
					res+=dat[ans+h-1];
					ans+=h;
				}
			}
		}
		return ans;
	}
};

signed main(){
	int_fast32_t N,Q;
	scanf("%" SCNdFAST32 "%" SCNdFAST32,&N,&Q);
	vector<int_fast64_t> A(N);
	for(int_fast32_t i=0;i<N;i++){
		scanf("%" SCNdFAST64,&A[i]);
	}
	vector<int_fast64_t> data=A;
	vector<vector<int_fast64_t>> query(Q);
	for(int_fast32_t i=0;i<Q;i++){
		int_fast32_t c;
		scanf("%" SCNdFAST32,&c);
		if(c==1){
			int_fast32_t k;
			int_fast64_t x;
			scanf("%" SCNdFAST32 "%" SCNdFAST64,&k,&x);
			data.emplace_back(x);
			query[i]={c,k,x};
			continue;
		}
		if(c==2){
			query[i]={c};
			continue;
		}
		int_fast32_t k;
		scanf("%" SCNdFAST32,&k);
		query[i]={c,k};
	}
	vector<int_fast64_t> data2=data;
	sort(data2.begin(),data2.end());
	data2.erase(unique(data2.begin(),data2.end()),data2.end());
	for(int_fast64_t &i : data){
		i=lower_bound(data2.begin(),data2.end(),i)-data2.begin();
	}
	vector<int_fast64_t> relation(*max_element(data.begin(),data.end())+1);
	for(int_fast32_t i=0;i<N;i++){
		relation[data[i]]=A[i];
		A[i]=data[i];
	}
	int_fast32_t mem=N;
	for(int_fast32_t i=0;i<Q;i++){
		if(query[i][0]==1){
			relation[data[mem]]=query[i][2];
			query[i][2]=data[mem];
			mem++;
		}
	}
	queue<int_fast64_t> change;
	vector<bool> change2(N,false);
	Fenwick_tree tree(relation.size());
	for(int_fast32_t i=0;i<N;i++){
		tree.add(A[i],1);
		change.emplace(i);
	}
	for(int_fast32_t i=0;i<Q;i++){
		if(query[i][0]==1){
			int_fast32_t k=query[i][1]-1;
			int_fast32_t x=query[i][2];
			A[k]=x;
			if(!change2[k]){
				change.emplace(k);
				change2[k]=true;
			}
		}
		if(query[i][0]==2){
			int_fast32_t t=change.size();
			for(;t--;){
				int_fast64_t j=change.front();
				change2[j]=false;
				change.pop();
				int_fast64_t t=tree.max_right(j);
				change.emplace((int_fast64_t)(N)*t+j);
			}
			while(!change.empty()){
				int_fast32_t t=change.front()/N;
				int_fast32_t j=change.front()%N;
				if(A[j]==-1){
					change.pop();
					continue;
				}
				tree.add(t,-1);
				tree.add(A[j],1);
				A[j]=-1;
				change.pop();
			}
		}
		if(query[i][0]==3){
			int_fast32_t k=query[i][1]-1;
			if(A[k]!=-1){
				printf("%" PRIdFAST64 "\n",relation[A[k]]);
			}
			else{
				printf("%" PRIdFAST64 "\n",relation[tree.max_right(k)]);
			}
		}
	}
}