#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
using ll = long long;
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define show(x) true
#endif

struct segtree{
	using D = int;
	D inf = 1e9;
	using P = pair<D,int>;

	int N;
	vector<P> val;
	
	segtree(){}
	segtree(const vector<D>& ds){
		int n = ds.size();
		N=1;
		while(N<n) N*=2;
		val.assign(N*2,P(inf,-1));
		rep(i,n) val[i+N] = P(ds[i],i);
		for(int i=N-1;i>0;i--) val[i] = min(val[i*2],val[i*2+1]);
	}
	void assign(int k,D d){
		k+=N;
		val[k]=P(d,k-N);
		k/=2;
		while(k){
			val[k] = min(val[k*2],val[k*2+1]);
			k/=2;
		}
	}
	P getmina(int a,int b){	//P(min,leftmost argmin)
		P res = P(inf,-1);
		a+=N,b+=N;
		while(a<b){
			if(a&1) chmin(res,val[a++]);
			if(b&1) chmin(res,val[--b]);
			a/=2,b/=2;
		}
		return res;
	}
};

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);
	
	int N,Q;
	cin >> N >> Q;
	V<int> a(N);
	rep(i,N) cin >> a[i];
	segtree seg(a);
	rep(_,Q){
		int t;
		cin >> t;
		if(t == 1){
			int l,r;
			cin >> l >> r;
			l--,r--;
			swap(a[l],a[r]);
			seg.assign(l,a[l]);
			seg.assign(r,a[r]);
		}else{
			int l,r;
			cin >> l >> r;
			l--;
			cout << seg.getmina(l,r).sc + 1 << endl;
		}
	}
}