class SegmentTree():
    """一点更新、区間取得クエリをそれぞれO(logN)で答えるデータ構造を構築する
    update: i番目をvalに変更する
    get_min: 区間[begin, end)の最小値を求める
    """
    def __init__(self, n):
        self.n = n
        self.INF = 2**31 - 1
        self.size = 1
        while self.size < n:
            self.size *= 2
        self.node = [self.INF] * (2*self.size - 1)

    def update(self, i, val):
        i += (self.size - 1)
        self.node[i] = val
        while i > 0:
            i = (i - 1) // 2
            self.node[i] = min(self.node[2*i + 1], self.node[2*i + 2])

    def get_min(self, begin, end):
        begin += (self.size - 1)
        end += (self.size - 1)
        s = self.INF
        while begin < end:
            if (end - 1) & 1:
                end -= 1
                s = min(s, self.node[end])
            if (begin - 1) & 1:
                s = min(s, self.node[begin])
                begin += 1
            begin = (begin - 1) // 2
            end = (end - 1) // 2
        return s

n, q = map(int, input().split())
a = list(map(int, input().split()))
st = SegmentTree(n)
for i in range(n):
    st.update(i, a[i])

pos = {}
for i in range(n):
    pos[a[i]] = i

for _ in range(q):
    j, l, r = map(int, input().split())
    if j == 1:
        tmp1 = st.get_min(l-1, l)
        tmp2 = st.get_min(r-1, r)
        st.update(r-1, tmp1)
        st.update(l-1, tmp2)
        pos[tmp1] = r-1
        pos[tmp2] = l-1
    if j == 2:
        print(pos[st.get_min(l-1, r)] + 1)