#include <stdio.h>
#include <bits/stdc++.h>

#define rep(i, n) for(int i = 0; i < n; i++)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int INF = 0x3f3f3f3f;
// 0x3f // 0xc0

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

const int Nmax = 100555;

int aib[1<<18];

void insert(int nod, int lo, int hi, int pos, int val) {
  if (lo == hi) {
    aib[nod] = val;
    return;
  }
  int mid = (lo + hi) / 2;
  if (pos <= mid) {
    insert(2*nod+1, lo, mid, pos, val);
  } else {
    insert(2*nod+2, mid+1, hi, pos, val);
  }
  aib[nod] = max(aib[2*nod+1], aib[2*nod+2]);
}

int query(int nod, int lo, int hi, int a, int b) {
  if (a <= lo && hi <= b) {
    return aib[nod];
  }
  int result = 0;
  int mid = (lo + hi)/2;
  if (a <= mid) {
    result = max(result, query(2*nod+1, lo, mid, a, b));
  }
  if (b > mid) {
    result = max(result, query(2*nod+2, mid+1, hi, a, b));
  }
  return result;
}

int main(void) {

  int N, M, x, a, b;
  fin >> N >> M;
  rep(i, N) {
    fin >> a;
    insert(0, 0, N-1, i, a);
  }
  rep(i, M) {
    fin >> x >> a >> b;
    if (x == 0) {
      fout << query(0, 0, N-1, a-1, b-1) << '\n';
    } else if (x == 1) {
      insert(0, 0, N-1, a-1, b);
    }
  }

  return 0;
}