#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, M = 1 << 9;
int A[N], AA[N], TP[N], L[N], R[N], AH[N], T[N << 1], TT[N << 1], K[N], RT[N],
    blk, n, q, nn, ll = 1, rr = 1, tt;
vector<int> v;
struct node {
  int l, r, t;
} Q[N];
bool cmp(const node& a, const node& b) {
  if (AH[a.l] ^ AH[b.l]) return (a.l < b.l);
  if (AH[a.r] ^ AH[b.r]) return (a.r < b.r);
  return (a.t < b.t);
}
void addmo(int ind, int d) {
  TT[T[A[ind]]]--;
  T[A[ind]] += d;
  TT[T[A[ind]]]++;
}
int main() {
  scanf("%d %d", &n, &q);
  blk = pow(n, 2.1 / 3.0);
  for (int i = 0; i < N; i++) AH[i] = i / blk;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &A[i]);
    v.push_back(A[i]);
  }
  for (int i = 1; i <= q; i++) {
    scanf("%d %d %d", &TP[i], &L[i], &R[i]);
    if (TP[i] == 2) v.push_back(R[i]);
  }
  set<int> st(v.begin(), v.end());
  v.assign(st.begin(), st.end());
  for (int i = 1; i <= n; i++)
    A[i] = lower_bound(v.begin(), v.end(), A[i]) - v.begin();
  for (int i = 1; i <= q; i++)
    if (TP[i] == 2) R[i] = lower_bound(v.begin(), v.end(), R[i]) - v.begin();
  memcpy(AA, A, sizeof(AA));
  for (int i = 1; i <= q; i++)
    if (TP[i] == 2) {
      K[i] = AA[L[i]];
      AA[L[i]] = R[i];
    }
  for (int i = 1; i <= q; i++)
    if (TP[i] == 1) Q[++nn] = {L[i], R[i], i};
  sort(Q + 1, Q + nn + 1, cmp);
  T[A[1]]++;
  TT[1]++;
  for (int i = 1; i <= nn; i++) {
    while (ll > Q[i].l) addmo(--ll, 1);
    while (rr < Q[i].r) addmo(++rr, 1);
    while (ll < Q[i].l) addmo(ll++, -1);
    while (rr > Q[i].r) addmo(rr--, -1);
    while (tt < Q[i].t) {
      tt++;
      if (TP[tt] == 1) continue;
      if (ll <= L[tt] && L[tt] <= rr) {
        addmo(L[tt], -1);
        A[L[tt]] = R[tt];
        addmo(L[tt], 1);
        continue;
      }
      A[L[tt]] = R[tt];
    }
    while (tt > Q[i].t) {
      if (TP[tt] == 1) {
        tt--;
        continue;
      }
      if (ll <= L[tt] && L[tt] <= rr) {
        addmo(L[tt], -1);
        A[L[tt]] = K[tt];
        addmo(L[tt], 1);
        tt--;
        continue;
      }
      A[L[tt]] = K[tt];
      tt--;
    }
    for (int j = 1;; j++)
      if (!TT[j]) {
        RT[Q[i].t] = j;
        break;
      }
  }
  for (int i = 1; i <= q; i++)
    if (TP[i] == 1) printf("%d\n", RT[i]);
}
