#include <bits/stdc++.h>
#define maxn 100100
#define pii pair <int, int> 
#define fi first
#define se second
#define pb push_back
using namespace std;
int n, m, T;
int a[maxn], b[maxn], cnt[2 * maxn], num[maxn], B, s;
int mq, mr, ans[maxn];

struct query {
	int l, r, id, tim;
	friend bool operator < (query a, query b) {
		if (a.l / B != b.l / B) return a.l < b.l;
		if (a.r / B != a.r / B) return a.r < b.r;
		return a.tim < b.tim;
	}
} Q[maxn];

struct change {
	int p, x;
} R[maxn];

inline int read() {
	int x = 0, f = 1;
	char c = getchar();
	while (c > '9' || c < '0') {
		if (c == '-') f = -1;
		c = getchar();
	}
	while (c >= '0' && c <= '9') {
		x = (x << 1) + (x << 3) + (c ^ 48);
		c = getchar();
	}
	return x * f;
}

inline void wrt(int x) {
	int y = 10, len = 1;
	if (x < 0) {
		x = -x;
		putchar('-');
	}
	while (y <= x) {
		len++;
		y *= 10;
	}
	while (len--) {
		y /= 10;
		putchar(x / y + '0');
		x %= y;
	}
}

void add(int x) {
	--num[cnt[x]];
	++num[++cnt[x]];
}

void del(int x) {
	--num[cnt[x]];
	++num[--cnt[x]];	
}

signed main() {
	n = read(); m = read();
	for (int i = 1; i <= n; i++) {
		b[i] = a[i] = read();
	}
	s = n;
	B = pow(n, 0.66);
	for (int i = 1; i <= m; i++) {
		int opt = read(), l = read(), r = read();
		if (opt == 1) {
			Q[++mq] = (query){l, r, mq, mr};
		}
		else {
			R[++mr] = (change){l, r};
			b[++s] = r;
		}
	}
	sort(b + 1, b + s + 1);
	int tot = unique(b + 1, b + s + 1) - b - 1;
	for (int i = 1; i <= n; i++) {
		a[i] = lower_bound(b + 1, b + tot + 1, a[i]) - b;
	}
	for (int i = 1; i <= mr; i++) {
		R[i].x = lower_bound(b + 1, b + tot + 1, R[i].x) - b;
	}
	sort(Q + 1, Q + mq + 1);
	int l = 1, r = 0, x = 0;
	for (int i = 1; i <= mq; i++) {
		while (l > Q[i].l) add(a[--l]);
		while (r < Q[i].r) add(a[++r]);
		while (l < Q[i].l) del(a[l++]);
		while (r > Q[i].r) del(a[r--]);
		
		while (x < Q[i].tim) {
			x++;
			int p = R[x].p;
			if (l <= p && p <= r) {
				del(a[p]); add(R[x].x);
			}
			swap(a[p], R[x].x);
		}
		while (x > Q[i].tim) {
			int p = R[x].p;
			if (l <= p && p <= r) {
				del(a[p]); add(R[x].x);
			}
			swap(a[p], R[x].x);
			x--;
		}
		for (ans[Q[i].id] = 1; num[ans[Q[i].id]] > 0; ++ans[Q[i].id]);
	}
	for (int i = 1; i <= mq; i++) {
		wrt(ans[i]);
		putchar('\n');
	}
	return 0;
}