import sys
sys.setrecursionlimit(10**7)
def ii(): return int(input())
def ist(): return input().split()
def mi(d=0): return map(lambda x:int(x)-d,input().split())
def lmi(d=0): return list(map(lambda x:int(x)-d,input().split()))
INF = 998244353
def answer(s):
  print(s)
  exit()
def cross(xy):
  x,y = xy
  return (x+1,y),(x-1,y),(x,y+1),(x,y-1)
################################################
class SegTree:
  def __init__(self,n,inf,order,arr):
    self.inf = inf
    self.order = order
    self.bitlen = 2**n.bit_length()
    self.len = n
    self.n = self.bitlen*2-1
    
    self.index = [-1]*n
    for i,a in enumerate(arr):
      self.index[a-1] = i
    
    arr += [inf]*(self.bitlen - n)
    self.arr = [None]*(self.bitlen-1) + arr

    def PreProcessing(index):
      if self.arr[index] == None:
        self.arr[index] = self.order(PreProcessing(2*index+1),PreProcessing(2*index+2))
      return self.arr[index]
    PreProcessing(0)
  
  #データ更新:index番目をxに変更
  def Renew(self,index,x):
    i = self.n - self.bitlen + index
    self.arr[i] = x
    while i != 0:
      i = (i-1)//2
      result = self.order(self.arr[i*2+1],self.arr[i*2+2])
      if result != self.arr[i]:
        self.arr[i] = result
    
  #要素の交換：l番目とr番目の位置を交換する。
  def Swap(self,l,r):
    left,right = self.arr[self.n-self.bitlen+l],self.arr[self.n-self.bitlen+r]
    self.Renew(l,right)
    self.index[right-1] = l
    self.Renew(r,left)
    self.index[left-1] = r

  #[x,y)の範囲の結果を取得
  def GetRange(self,x,y,k=0,l=0,r=-1):
    if r == -1:
      r = self.bitlen
    if y<=l or r<=x:
      return self.inf
    elif x<=l and r<=y:
      return self.arr[k]
    else:
      return self.order(
        self.GetRange(x,y,2*k+1,l,(l+r)//2),
        self.GetRange(x,y,2*k+2,(l+r)//2,r)
        )

n,q = mi()
a = lmi()
segtree = SegTree(n,INF,min,a)
m = min(a)
for _ in range(q):
  query,l,r = mi()
  if query == 1:
    segtree.Swap(l-1,r-1)
  else:
    ans = segtree.GetRange(l-1,r) #範囲内の最小値を取得
    print(segtree.index[ans-1]+1) #最小値のindexを出力