N, Q = map(int,input().split())
A = list(map(int,input().split()))
queries = [[int(e)-1 for e in input().split()] for _ in range(Q)]

# N: 処理する区間の長さ
N0 = 2**(N-1).bit_length()
INF = 2**31-1
data = [[INF,-1] for _ in range(2*N0)]

# a_k の値を x に更新
def update(k, x):
    data[k+N0-1] = [x, k]
    k += N0-1
    while k >= 0:
        k = (k - 1) // 2
        if data[2*k+1] < data[2*k+2]:
            data[k] = data[2*k+1][:]
        else:
            data[k] = data[2*k+2][:]

# 区間[l, r)の(最小値, インデックス)
def query(l, r):
    L = l + N0; R = r + N0
    s = [INF,-1]
    while L < R:
        if R & 1:
            R -= 1
            if s > data[R-1]:
                s = data[R-1]
        if L & 1:
            if s > data[L-1]:
                s = data[L-1]
            L += 1
        L >>= 1; R >>= 1
    return s

# 配列の初期化
for i, a in enumerate(A):
    update(i, a)

def solve(q, l, r):
    if q == 0:
        al, li = query(l, l+1)
        ar, ri = query(r, r+1)
        update(l, ar)
        update(r, al)
    elif q == 1:
        m, i = query(l,r+1)
        print(i+1)

for q, l, r in queries:
    solve(q, l, r)