#include <bits/stdc++.h>

using namespace std;

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

#define N_MAX 100000
int v[N_MAX + 5], aint[N_MAX * 4 + 5];

void build(int nod, int l, int r) {
  int mid;
  if(l == r) {
    aint[nod] = v[l];
  }else{
    mid = (l + r) / 2;
    build(nod * 2, l, mid);
    build(nod * 2 + 1, mid + 1, r);
    aint[nod] = max(aint[nod * 2], aint[nod * 2 + 1]);
  }
}

void update(int nod, int l, int r, int pos, int val) {
  int mid;
  if(l == r) {
    aint[nod] = val;
  }else{
    mid = (l + r) / 2;
    if(pos <= mid) {
      update(nod * 2, l, mid, pos, val);
    }else{
      update(nod * 2 + 1, mid + 1, r, pos, val);
    }
    aint[nod] = max(aint[nod * 2], aint[nod * 2 + 1]);
  }
}

int query(int nod, int l, int r, int st, int dr) {
  int mid;
  if(r < st || l > dr) {
    return 0;
  }
  if(l >= st && r <= dr) {
    return aint[nod];
  }
  mid = (l + r) / 2;
  return max(query(nod * 2, l, mid, st, dr), query(nod * 2 + 1, mid + 1, r, st, dr));
}


int main()
{
  int n, m, querytype, a, b, i;
  fin >> n >> m;
  for(i = 1; i <= n; ++i) {
    fin >> v[i];
  }
  build(1, 1, n);

  for(i = 0; i < m; ++i) {
    fin >> querytype >> a >> b;
    if(querytype == 0) {
      fout << query(1, 1, n, a, b) << "\n";
    }else{
      update(1, 1, n, a, b);
    }
  }



  return 0;
}