from collections import deque
from array import array

class FenwickTree:
    def __init__(self,size):
        self.tree=array("i",[0]*(size+1))
        self.size=size
        self.start=size.bit_length()-1
    def add(self,pos,val):
        pos+=1
        while pos<=self.size:
            self.tree[pos]+=val
            pos+=pos&-pos
    def bisect(self,pos):
        now=0
        val=0
        for i in range(self.start,-1,-1):
            if now+(1<<i)<=self.size and val+self.tree[now+(1<<i)]<=pos:
                now+=1<<i
                val+=self.tree[now]
        return now

N,Q=map(int,input().split())
A=list(map(int,input().split()))
query=[tuple(map(int,input().split())) for i in range(Q)]
press=A[:]
for i in range(Q):
    if query[i][0]==1:
        press.append(query[i][2])
press.sort()
ser={}
for i in range(len(press)):
    ser[press[i]]=i
a=FenwickTree(len(press))
for i in range(N):
    A[i]=ser[A[i]]
    a.add(A[i],1)
change=[-1]*N
chq=deque()
changed=set()
for i in range(Q):
    t,*q=query[i]
    if t==1:
        k,x=q
        x=ser[x]
        change[k-1]=x
        changed.add(k-1)
    if t==2:
        for j in changed:
            chq.append((a.bisect(j),change[j]))
            change[j]=-1;
        changed.clear()
        while chq:
            a.add(chq[-1][0],-1)
            a.add(chq[-1][1],1)
            chq.pop()
    if t==3:
        k=q[0]
        if change[k-1]==-1:
            print(press[a.bisect(k-1)])
        else:
            print(press[change[k-1]])