class SegmentTree:
    
    def __init__(self, N, A):
        
        self.n = 2 ** (N.bit_length())
        
        self.A = A + [N + 1]
        
        self.Tree = [N] * (self.n * 2 - 1)
        
        for i in range(N):
            
            self.Tree[self.n + i - 1] = i
        
            self.update(i)
    
    
    def update(self, i):
        
        i = (self.n + i) // 2 - 1
        
        while i >= 0:
            
            
            if self.A[self.Tree[i * 2 + 1]] < self.A[self.Tree[i * 2 + 2]]:
                
                self.Tree[i] = self.Tree[i * 2 + 1]
                
            else:
                
                self.Tree[i] = self.Tree[i * 2 + 2]
                
            i -= 1
            i //= 2
            
    def query(self, l, r):
        
        l -= 1
        
        i = l + self.n - 1
        
        ans = self.Tree[i]
        x = 2
        while l < r:
            if l + x <= r and i % 2:
                i = (i - 1) // 2
                x *= 2
            
            else:
                l = l + x // 2
                if self.A[ans] > self.A[self.Tree[i]]:
                    ans = self.Tree[i]
                
                i = l + self.n - 1
                x = 2
                
        return ans + 1

        
N, Q = map(int, input().split())

A = list(map(int, input().split()))

X = SegmentTree(N, A)

for i in range(Q):
    
    q, l, r = map(int, input().split())
    
    if q == 1:
        
        X.A[l - 1], X.A[r - 1] = X.A[r - 1], X.A[l - 1]
        X.update(l - 1)
        X.update(r - 1)
    else:
        
        print(X.query(l, r))