#data: (val, idx)
unit = (10**9, -1)


def op(A, B):
    if A[0] > B[0]:
        return B
    return A


class SegmentTree:
    def __init__(self, N, arr=None, op=None, unit=None):
        """
        INPUT
        N: 配列のサイズ
        segment tree: 1-indexedで構築
        original array: 0-indexed
                 1
           2           3
         4    5     6     7
        8 9 10 11 12 13 14 15
        ---------------------
        0 1 2  3  4  5  6  7
        """
        self.N = N
        self.unit = unit
        self.op = op
        self.tree = [unit] * (2 * N + 1)
        if arr is not None:
            self._build(arr)

    def _build(self, arr):
        op = self.op
        N = self.N
        for i, a in enumerate(arr, N):
            self.tree[i] = a
        for i in reversed(range(1, N)):
            self.tree[i] = op(self.tree[i << 1], self.tree[i << 1 | 1])

    def show(self):
        for i in range(self.N):
            print(self.tree[i+self.N], end=" ")
        print()

    def update(self, i, x):
        """
        arr[i]の値をxに変更する
        i: 0-indexed
        """
        i += self.N
        op = self.op
        self.tree[i] = x
        while i > 1:
            i >>= 1
            self.tree[i] = op(self.tree[i << 1], self.tree[i << 1 | 1])

    def swap(self, l, r):
        """
        arr[l], arr[r]をswap
        i: 0-indexed
        """
        lv, li = self.tree[l + self.N]
        rv, ri = self.tree[r + self.N]
        if lv > rv:
            self.update(l, (rv, li))
            self.update(r, (lv, ri))
        else:
            self.update(r, (lv, ri))
            self.update(l, (rv, li))

    def query(self, L, R):
        """
        L,R: 0-indexed
        半開区間[L,R)の累積演算した値を返す
        """
        op = self.op
        res = self.unit
        L += self.N
        R += self.N
        while L < R:
            if L & 1:
                res = op(res, self.tree[L])
                L += 1
            if R & 1:
                R -= 1
                res = op(res, self.tree[R])
            L >>= 1
            R >>= 1
        return res


N, Q = map(int, input().split())
arr = [(a, i + 1) for i, a in enumerate(map(int, input().split()))]

seg = SegmentTree(N, arr, op, unit)
for _ in range(Q):
    t, l, r = map(int, input().split())
    if t == 1:
        seg.swap(l - 1, r - 1)
    else:
        print(seg.query(l - 1, r)[1])