def segfunc(x,y):
    return min(x,y)

class SegTree:
    def __init__(self,x_list,init,segfunc):
        self.init=init
        self.segfunc=segfunc
        self.Height=len(x_list).bit_length()+1
        self.Tree=[init]*(2**self.Height)
        self.num=2**(self.Height-1)
        for i in range(len(x_list)):
            self.Tree[2**(self.Height-1)+i]=x_list[i]
        for i in range(2**(self.Height-1)-1,0,-1):
            self.Tree[i]=segfunc(self.Tree[2*i],self.Tree[2*i+1])

    def select(self,k):
        return self.Tree[k+self.num]

    def update(self,k,x):
        i=k+self.num
        self.Tree[i]=x
        while i>1:
            if i%2==0:
                self.Tree[i//2]=self.segfunc(self.Tree[i],self.Tree[i+1])
            else:
                self.Tree[i//2]=self.segfunc(self.Tree[i-1],self.Tree[i])
            i//=2

    def query(self,l,r):
        result=self.init
        l+=self.num
        r+=self.num+1

        while l<r:
            if l%2==1:
                result=self.segfunc(result,self.Tree[l])
                l+=1
            if r%2==1:
                result=self.segfunc(result,self.Tree[r-1])
            l//=2
            r//=2
        return result
n,q=map(int,input().split())
a=list(map(int,input().split()))
lis=[0]*(n+1)
for i in range(n):
    lis[a[i]]=i
seg=SegTree(a,10**18,segfunc)
for _ in range(q):
    com,x,y=map(int,input().split())
    x-=1;y-=1
    if com==2:
        num=seg.query(x,y)
        #print(num)
        print(lis[num]+1)
    else:
        num_x=seg.select(x);num_y=seg.select(y)
        #print(num_x,num_y)
        point_num_x=lis[num_x];point_num_y=lis[num_y]
        lis[num_x]=point_num_y
        lis[num_y]=point_num_x
        seg.update(x,num_y)
        seg.update(y,num_x)