INF = 10**30

class Rmin():
	def __init__(self, size):
		#the number of nodes is 2n-1
		self.n = 1
		while self.n < size:
			self.n *= 2
		self.node = [INF] * (2*self.n-1)

	def Access(self, x):
		return self.node[x+self.n-1]

	def Update(self, x, val):
		x += self.n-1
		self.node[x] = val
		while x > 0:
			x = (x-1)//2
			self.node[x] = min(self.node[2*x+1], self.node[2*x+2])
		return

	#[a, b)
	def Get(self, a, b, k=0, l=0, r=-1):
		if r < 0:
			r = self.n

		if a >= r or b <= l:
			return INF
		elif a <= l and b >= r:
			return self.node[k]
		else:
			vl = self.Get(a, b, 2*k+1, l, (l+r)//2)
			vr = self.Get(a, b, 2*k+2, (l+r)//2, r)
			return min(vl, vr)

import sys
def input():
	return sys.stdin.readline()[:-1]

n, q = map(int, input().split())
a = list(map(int, input().split()))
ind = [-1 for _ in range(n+1)]
segtree = Rmin(n)
for i, x in enumerate(a):
	segtree.Update(i, x)
	ind[x] = i
#print(ind)

for _ in range(q):
	k, l, r = map(int, input().split())
	if k == 1:
		ind[a[l-1]], ind[a[r-1]] = ind[a[r-1]], ind[a[l-1]]
		a[l-1], a[r-1] = a[r-1], a[l-1]
		#print(a, ind)
		segtree.Update(l-1, a[l-1])
		segtree.Update(r-1, a[r-1])
	else:
		res = segtree.Get(l-1, r)
		print(ind[res]+1)