#include <bits/stdc++.h>
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
const int N = 100005;
const int oo = 2e9;
int segt[N * 4];
int a[N];
void build(int node, int l, int r) {
  if (l == r) {
    segt[node] = a[l];
    return;
  }
  int mid = (l + r) / 2;
  build(node * 2, l, mid);
  build(node * 2 + 1, mid + 1, r);
  segt[node] = max(segt[node * 2], segt[node * 2 + 1]);
}
void upd(int node, int l, int r, int pos, int val) {
  if (l == r) {
    segt[node] = val;
    return;
  }
  int mid = (l + r) / 2;
  if (pos <= mid) {
    upd(2 * node, l, mid, pos, val);
  }
  else {
    upd(2 * node + 1, mid + 1, r, pos, val);
  }
  segt[node] = max(segt[node * 2], segt[node * 2 + 1]);
}
int q(int node, int l, int r, int st, int dr) {
  if (l > dr || r < st) {
    return 0;
  }
  if (l >= st && r <= dr) {
    return segt[node];
  }
  int mid = (l + r) / 2;
  return max(q(node * 2, l, mid, st, dr), q(node * 2 + 1, mid + 1, r, st, dr));
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  in >> n >> m;
  for (int i = 1; i <= n; i++) {
    in >> a[i];
  }
  build(1, 1, n);
  while(m--) {
    int op;
    in >> op;
    if(!op) {
      int x, y;
      in >> x >> y;
      out << q(1, 1, n, x, y) << "\n";
    }
    else {
      int pos, val;
      in >> pos >> val;
      upd(1, 1, n, pos, val);
    }
  }
  return 0;
}