#include <bits/stdc++.h>
#pragma GCC optimize("inline")
int rd() {
  register int k = 0;
  char c = getchar();
  while (c > '9' || c < '0') c = getchar();
  while (c >= '0' && c <= '9') k = k * 10 + c - 48, c = getchar();
  return k;
}
const int N = 100001;
struct Q {
  int o, t, l, r;
} q[N];
struct C {
  int x, v;
} c[N];
int n, m, p, l = 1, r, qn, cn, a[N], bl[N], ans[N], T, b[N << 1], B, v[N << 1],
             sv[N], s;
bool cmp(register const Q& x, register const Q& y) {
  return bl[x.l] != bl[y.l] ? x.l < y.l
                            : (bl[x.r] == bl[y.r] ? x.t < y.t : x.r < y.r);
}
void Ins(register int p) { --sv[v[p]], ++sv[++v[p]]; }
void Del(register int p) { --sv[v[p]], ++sv[--v[p]]; }
void Set(register int t, register int i) {
  if (q[i].l <= c[t].x && c[t].x <= q[i].r) Del(a[c[t].x]), Ins(c[t].v);
  std::swap(a[c[t].x], c[t].v);
}
int main() {
  B = n = rd(), m = rd(), p = pow(n, 0.66);
  for (register int i = 1; i <= n; ++i) b[i] = a[i] = rd(), bl[i] = i / p;
  for (register int i = 1; i <= m; ++i) {
    if (rd() == 1)
      ++qn, q[qn] = {qn, cn, rd(), rd()};
    else
      c[++cn] = {rd(), b[++B] = rd()};
  }
  std::sort(b + 1, b + B + 1), B = std::unique(b + 1, b + B + 1) - b - 1,
                               std::sort(q + 1, q + qn + 1, cmp);
  for (register int i = 1; i <= n; ++i)
    a[i] = std::lower_bound(b + 1, b + B + 1, a[i]) - b;
  for (register int i = 1; i <= cn; ++i)
    c[i].v = std::lower_bound(b + 1, b + B + 1, c[i].v) - b;
  for (register int i = 1; i <= qn; ++i) {
    while (l > q[i].l) Ins(a[--l]);
    while (r < q[i].r) Ins(a[++r]);
    while (l < q[i].l) Del(a[l++]);
    while (r > q[i].r) Del(a[r--]);
    while (T < q[i].t) Set(++T, i);
    while (T > q[i].t) Set(T--, i);
    for (s = 1; sv[s] > 0; ++s)
      ;
    ans[q[i].o] = s;
  }
  for (register int i = 1; i <= qn; ++i) printf("%d\n", ans[i]);
  return 0;
}
