#include"bits/stdc++.h"
using namespace std;
#define REP(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define rep(i,n) REP((i),0,(n))


//http://beet-aizu.hatenablog.com/entry/2019/03/12/171221
template<typename T>
class SegmentTree {
private:
	using F = function<T(T, T)>; // モノイド型
	int n; // 横幅
	F f;   // モノイド
	T e;   // モノイド単位元
	vector<T> data;

public:
	// init忘れに注意
	SegmentTree() {}
	SegmentTree(F f, T e) :f(f), e(e) {}
	void init(int n_) {
		n = 1;
		while (n < n_)n <<= 1;
		data.assign(n << 1, e);
	}
	void build(const vector<T>& v) {
		int n_ = v.size();
		init(n_);
		rep(i, n_)data[n + i] = v[i];
		for (int i = n - 1; i >= 0; i--) {
			data[i] = f(data[(i << 1) | 0], data[(i << 1) | 1]);
		}
	}
	void set_val(int idx, T val) {
		idx += n;
		data[idx] = val;
		while (idx >>= 1) {
			data[idx] = f(data[(idx << 1) | 0], data[(idx << 1) | 1]);
		}
	}
	T query(int a, int b) {
		// [a,b)
		T vl = e, vr = e;
		for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {
			if (l & 1)vl = f(vl, data[l++]); // unknown
			if (r & 1)vr = f(data[--r], vr); // unknown
		}
		return f(vl, vr);
	}
};

template<typename T>
using ST = SegmentTree<T>;


int main()
{
	int N, Q;
	cin >> N >> Q;
	vector<int> a(N);
	rep(i, N)cin >> a[i];

	constexpr int INF = 1 << 28;
	function<int(int, int)> f = [](int a, int b) {
		return min(a, b);
	};
	SegmentTree<int> st(f, INF);
	st.build(a);

	map<int, int> mp;
	rep(i, N)mp[a[i]] = i;

	rep(i, Q) {
		int com, l, r;
		cin >> com >> l >> r;
		l--;
		r--;
		if (com == 1) {
			int al = st.query(l, l + 1);
			int ar = st.query(r, r + 1);
			st.set_val(l, ar);
			st.set_val(r, al);
			mp[al] = r;
			mp[ar] = l;
		}
		else {
			int tgt = st.query(l, r + 1);
			cout << mp[tgt] + 1 << endl;
		}
	}

	return 0;
}