#include <fstream>
#include <iostream>

#define NMAX 100007

using namespace std;

ifstream fin("arbint.in");
ofstream fout("arbint.out");

int N, M;
int aint[4 * NMAX + 66];
int start, finish, Val, Pos, maxim;

inline int Maxim(int a, int b) {
  if (a > b)
    return a;
  return b;
}

void Update(int, int, int);
void Query(int, int, int);

int main() {
  int X, A, B;

  fin >> N >> M;
  for (int i = 1; i <= N; i++) {
    fin >> X;
    Pos = i, Val = X;
    Update(1, 1, N);
  }

  for (int i = 1; i <= M; i++) {
    fin >> X >> A >> B;
    if (X == 0) {
      maxim = -1;
      start = A, finish = B;
      Query(1, 1, N);
      fout << maxim << '\n';
    } else {
      Pos = A, Val = B;
      Update(1, 1, N);
    }
  }
}

void Update(int nod, int left, int right) {
  if (left == right) {
    aint[nod] = Val;
    return;
  }

  int div = (left + right) / 2;
  if (Pos <= div)
    Update(2 * nod, left, div);
  else
    Update(2 * nod + 1, div + 1, right);

  aint[nod] = std::max(aint[2 * nod], aint[2 * nod + 1]);
}

void Query(int nod, int left, int right) {
  if (start <= left && right <= finish) {
    if (maxim < aint[nod])
      maxim = aint[nod];
    return;
  }

  int div = (left + right) / 2;
  if (start <= div)
    Query(2 * nod, left, div);
  if (div < finish)
    Query(2 * nod + 1, div + 1, right);
}