class SegTree:
    """ define what you want to do with 0 index, ex) size = tree_size, func = min or max, sta = default_value """
    
    def __init__(self,size,func,sta):
        self.n = size
        self.size = 1 << size.bit_length()
        self.func = func
        self.sta = sta
        self.tree = [sta]*(2*self.size)

    def build(self, list):
        """ set list and update tree"""
        for i,x in enumerate(list,self.size):
            self.tree[i] = x

        for i in range(self.size-1,0,-1):
            self.tree[i] = self.func(self.tree[i<<1],self.tree[i<<1 | 1])

    def set(self,i,x):
        i += self.size
        self.tree[i] = x
        while i > 1:
            i >>= 1
            self.tree[i] = self.func(self.tree[i<<1],self.tree[i<<1 | 1])

    
    def get(self,l,r):
        """ take the value of [l r) with func (min or max)"""
        l += self.size
        r += self.size
        res = self.sta

        while l < r:
            if l & 1:
                res = self.func(self.tree[l],res)
                l += 1
            if r & 1:
                res = self.func(self.tree[r-1],res)
            l >>= 1
            r >>= 1
        return res


n,q = map(int,input().split())
A = list(map(int,input().split()))
idx = [0]*(n+1)
for i,a in enumerate(A):
    idx[a] = i
seg = SegTree(n,min,10**10)
seg.build(A)

for _ in range(q):
    t,l,r = map(int,input().split())
    
    if t == 1:
        l,r = l-1,r-1
        al,ar = A[l],A[r]
        idx[al],idx[ar] = idx[ar],idx[al]
        A[l],A[r] = A[r],A[l]
        seg.set(l,ar)
        seg.set(r,al)

    else:
        l -= 1
        ma = seg.get(l,r)
        print(idx[ma]+1)