inf = float('inf')

class SegmentTree:
    def __init__(self, N):
        self.N = 2**(N-1).bit_length()
        self.data = [[inf, -1]] * (2*self.N)

    def update(self, k, x):
        k += self.N-1
        self.data[k] = [x, k-(N-1)]
        while k >= 0:
            k = (k - 1) // 2
            if self.data[2*k+1] < self.data[2*k+2]:
                self.data[k] = self.data[2*k+1][:]
            else:
                self.data[k] = self.data[2*k+2][:]
    
    def query(self, l, r):
        L = l + self.N
        R = r + self.N
        s = [inf, -1]
        while L < R:
            if R & 1:
                R -= 1
                if s > self.data[R-1]:
                    s = self.data[R-1][:]
            if L & 1:
                if s > self.data[L-1]:
                    s = self.data[L-1][:]
                L += 1
            L >>= 1; R >>= 1
        return s

N, Q = map(int,input().split())
A = list(map(int,input().split()))
query = [list(map(int,input().split())) for _ in range(Q)]

st = SegmentTree(N)

for i, a in enumerate(A):
    st.update(i, a)

for q, l, r in query:
    l -= 1
    r -= 1
    if q == 1:
        al, li = st.query(l,l+1)
        ar, ri = st.query(r,r+1)
        st.update(l, ar)
        st.update(r, al)
    elif q == 2:
        m, i = st.query(l,r+1)
        print(i)