#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

struct SegTree {
	std::vector<std::pair<int, int> > data;
	int n;
	SegTree(const std::vector<int> &a) {
		for (n = 1; n < (int) a.size(); n *= 2);
		data.resize(2 * n, {1000000000, -1});
		for (int i = 0; i < (int) a.size(); i++) data[i + n] = {a[i], i};
		for (int i = n - 1; i; i--) data[i] = data[i << 1].first < data[i << 1 | 1].first ? data[i << 1] : data[i << 1 | 1];
	}
	void set(int i, int val) {
		for (data[i += n].first = val; i >>= 1; ) data[i] = data[i << 1].first < data[i << 1 | 1].first ? data[i << 1] : data[i << 1 | 1];
	}
	int get(int l, int r) {
		int res = -1;
		int min = 1000000000;
		for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
			if (r & 1) if (min > data[--r].first) min = data[r].first, res = data[r].second;
			if (l & 1) {
				if (min > data[l].first) min = data[l].first, res = data[l].second;
				l++;
			}
		}
		return res;
	}
	std::pair<int, int> operator [] (size_t i) { return data[i + n]; }
};

int main() {
	int n = ri();
	int q = ri();
	std::vector<int> a(n);
	for (int i = 0; i < n; i++) a[i] = ri();
	SegTree tree(a);
	for (int i = 0; i < q; i++) {
		int t = ri();
		int l = ri() - 1, r = ri() - 1;
		if (t == 1) {
			int x = tree[l].first, y = tree[r].first;
			tree.set(l, y);
			tree.set(r, x);
		} else {
			printf("%d\n", tree.get(l, r + 1) + 1);
		}
	}
	return 0;
}