class SegmentTree(object):
    __slots__ = ["elem_size", "tree", "default", "op"]
    def __init__(self, a, default, op):
        from math import ceil, log
        real_size = len(a)
        self.elem_size = elem_size = 1 << ceil(log(real_size, 2))
        self.tree = tree = [default] * (elem_size * 2)
        tree[elem_size:elem_size + real_size] = a
        self.default = default
        self.op = op
        for i in range(elem_size - 1, 0, -1):
            tree[i] = op(tree[i << 1], tree[(i << 1) + 1])

    def get_value(self, x: int, y: int) -> int:  # 半開区間
        l, r = x + self.elem_size, y + self.elem_size
        tree, result, op = self.tree, self.default, self.op
        while l < r:
            if l & 1:
                result = op(tree[l], result)
                l += 1
            if r & 1:
                r -= 1
                result = op(tree[r], result)
            l, r = l >> 1, r >> 1
        return result

    def set_value(self, i:int, value) -> None:
        k = self.elem_size + i
        self.tree[k] = value
        self.update(k)

    def update(self, i:int) -> None:
        op, tree = self.op, self.tree
        while i > 1:
            i >>= 1
            tree[i] = op(tree[i << 1], tree[(i << 1) + 1])

N, Q = map(int, input().split())
A = list(map(int, input().split()))
seg = SegmentTree(list(enumerate(A)),
                  (-1, float("inf")),
                  lambda x, y: x if x[1]<y[1] else y)
V = seg.tree
siz = seg.elem_size
Ans = []
for i in range(Q):
    q, l, r = map(int, input().split())
    if q==1:
        l-=1
        r-=1
        (_, al), (_, ar) = V[l+siz], V[r+siz]
        seg.set_value(l, (l, ar))
        seg.set_value(r, (r, al))
    else:
        l-=1
        ami, mi = seg.get_value(l, r)
        Ans.append(ami+1)
print("\n".join(map(str, Ans)))