#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int a[maxn], last[maxn], bl[maxn], br[maxn], cnt[maxn], num[maxn], result[maxn];
int size = 0, l = 1, r = 0;
unordered_map<int, int> mp;
struct query {
  int l, r, id, tim;
} Q[maxn];
struct replace {
  int x, c, last;
} R[maxn];
int getid(int x) {
  if (!mp[x]) mp[x] = ++size;
  return mp[x];
}
bool cmp(query a, query b) {
  return bl[a.id] == bl[b.id]
             ? (br[a.id] == br[b.id] ? a.tim < b.tim : br[a.id] < br[b.id])
             : bl[a.id] < bl[b.id];
}
void change(int x, int c) {
  if (x >= l && x <= r) {
    num[cnt[a[x]]]--;
    cnt[a[x]]--;
    num[cnt[a[x]]]++;
    a[x] = c;
    num[cnt[a[x]]]--;
    cnt[a[x]]++;
    num[cnt[a[x]]]++;
  } else
    a[x] = c;
}
void del(int x) {
  if (cnt[a[x]] > 0) num[cnt[a[x]]]--;
  cnt[a[x]]--;
  if (cnt[a[x]] > 0) num[cnt[a[x]]]++;
}
void add(int x) {
  if (cnt[a[x]] > 0) num[cnt[a[x]]]--;
  cnt[a[x]]++;
  if (cnt[a[x]] > 0) num[cnt[a[x]]]++;
}
int main() {
  int n, q;
  scanf("%d%d", &n, &q);
  int block = (int)pow(n, 2.0 / 3);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    a[i] = getid(a[i]);
    last[i] = a[i];
  }
  int opt, k = 0, rd = 0;
  for (int i = 1; i <= q; i++) {
    scanf("%d", &opt);
    if (opt == 1) {
      ++k;
      scanf("%d%d", &Q[k].l, &Q[k].r);
      Q[k].id = k;
      Q[k].tim = rd;
      bl[k] = Q[k].l / block;
      br[k] = Q[k].r / block;
    } else {
      ++rd;
      scanf("%d%d", &R[rd].x, &R[rd].c);
      R[rd].c = getid(R[rd].c);
      R[rd].last = last[R[rd].x];
      last[R[rd].x] = R[rd].c;
    }
  }
  sort(Q + 1, Q + k + 1, cmp);
  int head = 0;
  for (int i = 1; i <= k; i++) {
    while (head < Q[i].tim) {
      head++;
      change(R[head].x, R[head].c);
    }
    while (head > Q[i].tim) {
      change(R[head].x, R[head].last);
      head--;
    }
    while (l < Q[i].l) del(l++);
    while (l > Q[i].l) add(--l);
    while (r < Q[i].r) add(++r);
    while (r > Q[i].r) del(r--);
    for (result[Q[i].id] = 1; num[result[Q[i].id]] > 0; result[Q[i].id]++)
      ;
  }
  for (int i = 1; i <= k; i++) printf("%d\n", result[i]);
  return 0;
}
