#include <stdio.h>
constexpr int kN = int(1E5 + 10), kInf = int(1E9 + 10);
struct seg_tree {
	int val[kN << 2], pos[kN << 2];
	void pull(int n) {
		if (val[n * 2 + 1] > val[n * 2 + 2]) {
			val[n] = val[n * 2 + 2];
			pos[n] = pos[n * 2 + 2];
		}
		else {
			val[n] = val[n * 2 + 1];
			pos[n] = pos[n * 2 + 1];
		}
		return ;
	}
	void init(int n, int l, int r, int a[]) {
		if (l == r) {
			val[n] = a[l];
			pos[n] = l;
		}
		else {
			int mid = (l + r) >> 1;
			init(n * 2 + 1, l, mid, a);
			init(n * 2 + 2, mid + 1, r, a);
			pull(n);
		}
		return ;
	}
	void fix(int n, int l, int r, int p, int x) {
		if (l == r) {
			val[n] += x;
			pos[n] = p;
		}
		else {
			int mid = (l + r) >> 1;
			if (p > mid) fix(n * 2 + 2, mid + 1, r, p, x);
			else fix(n * 2 + 1, l, mid, p, x);
			pull(n);
		}
		return ;
	}
	int ask(int n, int l, int r, int L, int R, int &v) {
		if (L <= l && r <= R) {
			v = val[n];
			return pos[n];
		}
		else if (L > r || l > R) {
			v = kInf;
			return -1;
		}
		else {
			int mid = (l + r) >> 1, lpos, rpos, lans, rans;
			lpos = ask(n * 2 + 1, l, mid, L, R, lans);
			rpos = ask(n * 2 + 2, mid + 1, r, L, R, rans);
			if (lans < rans) {
				v = lans;
				return lpos;
			}
			else {
				v = rans;
				return rpos;
			}
		}
	}
};

void swap(int &a, int &b) {
	int temp = a;
	a = b;
	b = temp;
	return ;
}

seg_tree sg;
int a[kN];

int main () {
	int n, q, l, r, k;
	scanf("%d%d", &n, &q);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	sg.init(0, 1, n, a);
	while (q--) {
		scanf("%d%d%d", &k, &l, &r);
		if (k == 1) {
			sg.fix(0, 1, n, l, a[r] - a[l]);
			sg.fix(0, 1, n, r, a[l] - a[r]);
			swap(a[l], a[r]);
		}
		else printf("%d\n", sg.ask(0, 1, n, l, r, k));
	}
}