class SegTree:
    """ segment tree with point modification and range product. """
    def __init__(self, N, data_f = min, data_unit=1<<30):
        self.N = N
        self.data_f = data_f
        self.data_unit = data_unit
        self.data = [self.data_unit] * (N + N)

    def build(self, raw_data):
        data = self.data
        f = self.data_f
        N = self.N
        data[N:] = raw_data[:]
        for i in range(N - 1, 0, -1):
            data[i] = f(data[i << 1], data[i << 1 | 1])

    def set_val(self, i, x):
        data = self.data
        f = self.data_f
        i += self.N
        data[i] = x
        while i > 1:
            data[i >> 1] = f(data[i], data[i ^ 1])
            i >>= 1

    def fold(self, L, R):
        """ compute for [L, R) """
        vL = vR = self.data_unit
        data = self.data
        f = self.data_f
        L += self.N
        R += self.N
        while L < R:
            if L & 1:
                vL = f(vL, data[L])
                L += 1
            if R & 1:
                R -= 1
                vR = f(data[R], vR)
            L >>= 1
            R >>= 1
        return f(vL, vR)
N,Q=map(int,input().split())
A = [0]+list(map(int,input().split()))

rmq = SegTree(N+1)
rmq.build(A)
indices = {A[i]:i for i in range(1,N+1)}
    
for i in range(Q):
    n,l,r=map(int,input().split())
    if n == 1:
        A[l],A[r] = A[r],A[l]
        rmq.set_val(l,A[l])
        rmq.set_val(r,A[r])
        indices[A[l]] = l
        indices[A[r]] = r
    else:
        MIN = rmq.fold(l,r+1)
        idx = indices[MIN]
        print(idx)