#include <bits/stdc++.h>
using namespace std;

template<class T>
struct SegmentTree {
	using F = function<T(T, T)>;
	const T init;
	const F f;
	int sz;
	vector<T> seg;
	SegmentTree(int n, const T init, const F f) :
		init(init),
		f(f)
		{
			sz = 1;
			while(sz < n) sz <<= 1;
			seg.resize(sz << 1, init);
		}
	void update(int id) {
		while(id >>= 1) {
			seg[id] = f(seg[2 * id], seg[2 * id + 1]);
		}
	}
	void replace(int id, T x){
		id += sz;
		seg[id] = x;
		update(id);
	}
	// [l,r)
	T get(int l, int r){
		T L = init, R = init;
		for(l += sz, r += sz; l < r; l >>= 1, r>>= 1) {
			if(l & 1) L = f(L, seg[l++]);
			if(r & 1) R = f(seg[--r], R);
		}
		return f(L, R);
	}
	void debug(){
		int i = 1;
		for(int r = 2; r <= 2 * sz; r <<= 1) {
			while(i < r) {
				cout << seg[i++] << " ";
			}
			cout << "\n";
		}
	}
};

int main() {
	int n, q; cin >> n >> q;
	SegmentTree<pair<int, int>> seg(n, {1e9, -1}, [](pair<int, int> lhs, pair<int, int> rhs){return min(lhs, rhs);});
	for(int i = 0; i < n; ++i) {
		int a; cin >> a;
		seg.replace(i, {a, i + 1});
	}
	while(q--) {
		int i; cin >> i;
		int l, r; cin >> l >> r;
		--l, --r;
		if(i == 1) {
			int ll = seg.get(l, l + 1).first;
			int rr = seg.get(r, r + 1).first;
			seg.replace(l, {rr, l + 1});
			seg.replace(r, {ll, r + 1});
		}
		if(i == 2) {
			cout << seg.get(l, r + 1).second << '\n';
		}
	}
	return 0;
}