#include <bits/stdc++.h>
#define L 100005
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");

int n, q;
int v[L], aint[4 * L];

void build(int node, int le, int ri) {
  if (le == ri) {
    aint[node] = v[le];
    return;
  }
  int mid = (le + ri) / 2;
  build(2 * node, le, mid);
  build(2 * node + 1, mid + 1, ri);
  aint[node] = max(aint[2 * node], aint[2 * node + 1]);
}

void update(int node, int le, int ri, int pos, int val) {
  if (le == ri) {
    aint[node] = val;
    return;
  }
  int mid = (le + ri) / 2;
  if (pos <= mid)
    update(2 * node, le, mid, pos, val);
  else
    update(2 * node + 1, mid + 1, ri, pos, val);
  aint[node] = max(aint[2 * node], aint[2 * node + 1]);
}

int query(int node, int le, int ri, int x, int y) {
  if (x > y)
    return -1;
  if (le == x && ri == y)
    return aint[node];
  int mid = (le + ri) / 2;
  return max(query(2 * node, le, mid, x, min(mid, y)), query(2 * node + 1, mid + 1, ri, max(mid + 1, x), y));
}

int main() {
  fin >> n >> q;
  for (int i = 1; i <= n; i++)
    fin >> v[i];
  build(1, 1, n);
  for (int i = 1; i <= q; i++) {
    int t, a, b;
    fin >> t >> a >> b;
    if (t == 0)
      fout << query(1, 1, n, a, b) << "\n";
    else
      update(1, 1, n, a, b);
  }
  return 0;
}