import sys
readline = sys.stdin.readline

class SegmentTree:
    def __init__(self, size, f=min, default=10 ** 18):
        self.size = 2**(size-1).bit_length() 
        self.default = default
        self.dat = [default]*(self.size*2) 
        self.f = f

    def update(self, i, x):
        i += self.size
        self.dat[i] = x
        while i > 0:
            i >>= 1
            self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])

    def query(self, l, r):
        l += self.size
        r += self.size
        lres, rres = self.default, self.default
        while l < r:
            if l & 1:
                lres = self.f(lres, self.dat[l])
                l += 1

            if r & 1:
                r -= 1
                rres = self.f(self.dat[r], rres) 
            l >>= 1
            r >>= 1
        res = self.f(lres, rres)
        return res

N, Q = map(int, readline().split())
A = list(map(int, readline().split()))
T = SegmentTree(N)
for i in range(N):
    T.update(i, A[i] * N + i)
    
for _ in range(Q):
    query = list(map(int, readline().split()))
    l, r = query[1:]
    l, r = l - 1, r - 1 
    if query[0] == 1:
        A[l], A[r] = A[r], A[l]
        T.update(l, A[l] * N + l)
        T.update(r, A[r] * N + r)
    else:
        print(T.query(l, r + 1) % N + 1)