#include <bits/stdc++.h>

using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
const int MAX = 4e5;
int t[MAX];

void constructie(int p, int st, int dr){
  if(st == dr){
    in >> t[p];
    return;
  }
  int m = (st + dr) / 2, fs = 2 * p, fd = 2 * p + 1;
  constructie(fs, st, m);
  constructie(fd, m + 1, dr);
  t[p] = max(t[fs], t[fd]);
}

void actualizare(int p, int st, int dr, int poz, int val){
  if(st == dr){
    t[p] = val;
    return;
  }
  int m = (st + dr) / 2, fs = 2 * p, fd = 2 * p + 1;
  if(poz <= m) //daca elem cautat este in partea stanga acualiez doar stanga
    actualizare(fs, st, m, poz, val);
  else // daca elem cautat e in partea dreapta acualizez doar dreapta
    actualizare(fd, m + 1, dr, poz, val);
  t[p] = max(t[fs], t[fd]);
}
int interogare(int p, int st, int dr, int a, int b){
  if(a <= st && dr <= b){
    return t[p];
  }
  int m = (st + dr) / 2, fs = 2 * p, fd = 2 * p + 1;
  int rezs = 0, rezd = 0;
  if(a <= m){
    rezs = interogare(fs, st, m, a, b);
  }
  if(m + 1 <= b){
    rezd = interogare(fd, m + 1, dr, a, b);
  }
  return max(rezs, rezd);
}

int main()
{
    int n, m;
    in >> n >> m;
    constructie(1, 1, n);
    int x;
    for(int i = 0; i < m; i++){
      in >> x;
      if(x == 0){
        int a, b;
        in >> a >> b;
        out << interogare(1, 1, n, a, b) << endl;
      }
      else{
        int poz, val;
        in >> poz >> val;
        actualizare(1, 1, n, poz, val);
      }
    }
    return 0;
}