//yuki875.cpp
//Sun Jan  5 17:24:15 2020

#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int seg[4*100000];
int nodenum;

void init(int n){
	nodenum = 1;
	while (nodenum<n){
		nodenum *= 2;
	}
	for (int i=0;i<nodenum*2-1;i++){
		seg[i] = INTINF;
	}
}

void update(int index, int num){
	index += nodenum-1;
	seg[index] = num;
	while (index>0){
		index = (index-1)/2;
		seg[index] = min(seg[index*2+1],seg[index*2+2]);
	}
}

//Note that query is [a,b).
int query(int a, int b, int k, int l, int r){
	if (r<=a || b<=l){
		return INTINF;
	}
	if (a<=l && r<=b){
		return seg[k];
	}else {
		int vl = query(a,b,k*2+1,l,(l+r)/2);
		int vr = query(a,b,k*2+2,(l+r)/2,r);
		return min(vl,vr);
	}
}

int main(){
	int n,q;
	cin >> n >> q;

	init(n);

	map<int,int> mp;
	for (int i=0;i<n;i++){
		int temp;
		cin >> temp;
		seg[nodenum-1+i]=temp;
		mp[temp] = i;
	}

	for (int i=nodenum-2;i>=0;i--){
		seg[i] = min(seg[i*2+1],seg[i*2+2]);
	}

	for (int i=0;i<q;i++){
		int num,l,r;
		cin >> num >> l >> r;
		l--;r--;
		if (num==2){
			int ans = query(l,r+1,0,0,nodenum);
			cout << mp[ans]+1 << endl;
		}else {
			int templ = seg[l+nodenum-1];
			int tempr = seg[r+nodenum-1];
			update(l,tempr);
			update(r,templ);
			mp[templ] = r;
			mp[tempr] = l;
		}
	}
	
}