#include <cstdio>
#include <iostream>

#define _MAX_N 100100

using namespace std;

int myarb[4 * _MAX_N], n, m;

void update(int *arb, int node, int left, int right, int val, int pos) {

  if(left == right) {
    arb[node] = val;
    return;
  }

  int mid = left + (right - left) / 2;

  if(pos <= mid)
    update(arb, 2 * node, left, mid, val, pos);
  else
    update(arb, 2 * node + 1, mid + 1, right, val, pos);

  arb[node] = max(arb[2 * node], arb[2 * node + 1]);
}

int query(int *arb, int node, int left, int right, int a, int b) {
  if(a <= left && right <= b)
    return arb[node];

  int max1 = 0, max2 = 0, mid = left + (right - left) / 2;

  if(a <= mid)
    max1 = query(arb, 2 * node, left, mid, a, b);
  if(b > mid)
    max2 = query(arb, 2 * node + 1, mid + 1, right, a, b);

  return max(max1, max2);
}

int main() {

  int x, op, a, b;

  freopen("arbint.in", "r", stdin);
  freopen("arbint.out", "w", stdout);

  scanf("%d%d", &n, &m);

  for(int i = 1; i <= n; i ++) {
    scanf("%d", &x);
    update(myarb, 1, 1, n, x, i);
  }
  for(int i = 1; i <= m; i ++) {
    scanf("%d%d%d", &op, &a, &b);
    if(op == 0) 
      printf("%d\n", query(myarb, 1, 1, n, a, b));
    if(op == 1)
      update(myarb, 1, 1, n, b, a);
  }
}