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

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

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

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

const int Nmax = 1<<18;

int n, m, q, a, b, arb[Nmax];

void upd(int nod, int l, int r, int pos, int val) {
  if (l == r) { arb[nod] = val; return; } // l == r == pos

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

int query(int nod, int l, int r, int a, int b) {
  if (a <= l && r <= b) { return arb[nod]; }
  int mid = l + (r-l)/2;
  int res = -1;
  if (a <= mid) { res = max(res, query(2*nod, l, mid, a, b)); }
  if (b > mid) { res = max(res, query(2*nod+1, mid+1, r, a, b)); }
  return res;
}

int main(void) {
  // freopen("arbint.in", "r", stdin);
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);

  fin >> n >> m;

  rep(i, n) {
    fin >> a;
    upd(1, 1, n, i+1, a);
  }

  rep(i, m) {
    fin >> q >> a >> b;
    switch(q) {
      case 0:
        fout << query(1, 1, n, a, b) << '\n';
        break;
      case 1:
        upd(1, 1, n, a, b);
        break;
    }
  }

  return 0;
}