class SegTree():
    def __init__(self, lists, function, basement):
        self.n = len(lists)
        self.K = (self.n-1).bit_length()
        self.func = function
        self.basement = basement
        self.seg = [basement]*2**(self.K+1)

        for i in range(self.n):
            self.seg[i+2**self.K-1] = lists[i]

        for i in range(2**(self.K)-2, -1, -1):
            self.seg[i] = self.func(self.seg[2*i+1], self.seg[2*i+2])

    def update(self, k, value):
        # 0-indexでa[k]の値をvalueに変更
        k += 2**self.K-1
        self.seg[k] = value
        while k:
            k = (k-1)//2
            self.seg[k] = self.func(self.seg[k*2+1], self.seg[k*2+2])

    def query(self, p, q):
        # 0-indexで[p,q)の値を取得する
        if q <= p:
            return self.basement
        num = 2**self.K
        p += num-1
        q += num-2
        res = self.basement
        while q-p > 1:
            if p & 1 == 0:
                res = self.func(res, self.seg[p])
            if q & 1 == 1:
                res = self.func(res, self.seg[q])
                q -= 1
            p = p//2
            q = (q-1)//2
        if p == q:
            res = self.func(res, self.seg[p])
        else:
            res = self.func(self.func(res, self.seg[p]), self.seg[q])
        return res


def compare(X, Y):
    if X[0] < Y[0]:
        return X
    return Y


N, Q = map(int, input().split())
A = list(map(int, input().split()))
que = [tuple(map(int, input().split())) for _ in range(Q)]

for index, v in enumerate(A):
    A[index] = (v, index+1)

seg = SegTree(A, compare, (N+1, -1))

for index, p, q in que:
    if index == 1:
        # swap
        v1 = seg.query(p-1, p)[0]
        v2 = seg.query(q-1, q)[0]
        seg.update(p-1, (v2, p))
        seg.update(q-1, (v1, q))
    else:
        mini = seg.query(p-1, q)[1]
        print(mini)