#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#pragma warning (disable: 4996)

pair<int, int> dat[1 << 18];
int size_ = 1;

void init(int sz) {
	while (size_ <= sz) size_ *= 2;

	for (int i = 0; i < size_; i++) dat[i + size_] = make_pair(1 << 30, i);
	for (int i = size_ - 1; i >= 1; i--) dat[i] = min(dat[i * 2], dat[i * 2 + 1]);
}

void update(int pos, int x) {
	int cx = pos + size_;
	dat[cx] = make_pair(x, pos);

	while (cx >= 2) {
		cx >>= 1;
		dat[cx] = min(dat[cx * 2], dat[cx * 2 + 1]);
	}
}

pair<int, int> query_(int l, int r, int a, int b, int u) {
	if (l <= a && b <= r) return dat[u];
	if (r <= a || b <= l) return make_pair(1 << 30, 0);

	pair<int, int> v1 = query_(l, r, a, (a + b) >> 1, u * 2);
	pair<int, int> v2 = query_(l, r, (a + b) >> 1, b, u * 2 + 1);
	return min(v1, v2);
}

pair<int, int> query(int l, int r) {
	return query_(l, r, 0, size_, 1);
}

int N, Q, A[1 << 17];

int main() {
	scanf("%d%d", &N, &Q);
	for (int i = 0; i < N; i++) scanf("%d", &A[i]);
	init(N + 1);
	for (int i = 0; i < N; i++) update(i, A[i]);

	for (int i = 0; i < Q; i++) {
		int ty, l, r; scanf("%d%d%d", &ty, &l, &r);
		l--; r--;

		if (ty == 1) {
			swap(A[l], A[r]);
			update(l, A[l]);
			update(r, A[r]);
		}
		if (ty == 2) {
			pair<int, int> Z = query(l, r + 1);
			printf("%d\n", Z.second + 1);
		}
	}
	return 0;
}