import math
def chmin(a, b):
    if a > b:
        a = b
class SegmentTree:
    def __init__(self, sz):
        self.n = 2 ** math.ceil(math.log2(sz))
        self.dat = [int(2 ** 31 - 1) // 3] * (self.n * 2 - 1)
    def update(self, i, x):
        k = i + self.n - 1
        self.dat[k] = x
        while k > 0:
            k = (k - 1) // 2
            self.dat[k] = min(self.dat[k * 2 + 1], self.dat[k * 2 + 2])
    def rmin(self, ql, qr, i=0, il=0, ir=None):
        if ir is None:
            ir = self.n
        if qr <= il or ir <= ql:
            return int(2 ** 31 - 1) // 3
        elif ql <= il and ir <= qr:
            return self.dat[i]
        else:
            m = (il + ir) // 2
            return min(
                self.rmin(ql, qr, i * 2 + 1, il, m),
                self.rmin(ql, qr, i * 2 + 2, m, ir))
    def get(self, i):
        return self.dat[i + self.n - 1]
n, q = map(int, input().split())
a = list(map(lambda x: int(x) - 1, input().split()))
pos = [0] * n
seg = SegmentTree(n)
for i in range(n):
    pos[a[i]] = i
    seg.update(i, a[i])
for qq in range(q):
    t, i, j = map(int, input().split())
    i -= 1
    j -= 1
    if t == 1:
        ei = seg.get(i)
        ej = seg.get(j)
        seg.update(i, ej)
        seg.update(j, ei)
        pos[ei] = j
        pos[ej] = i
    else:
        print(pos[seg.rmin(i, j + 1)] + 1)