#include <bits/stdc++.h>
#define NMAX 100000
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int segTree[4 * NMAX + 5];
int val[NMAX + 5];
void build(int node, int l, int r){
    if(l == r)
        segTree[node] = val[l];
    else {
        int mid = (l + r) / 2;
        build(2 * node, l, mid);
        build(2 * node + 1, mid + 1, r);
        segTree[node] = max(segTree[2 * node], segTree[2 * node + 1]);
    }
}
void update(int node, int l, int r, int pos, int v){
    if(l == r)
        segTree[node] = v;
    else{
        int mid = (l + r) / 2;
        if(pos <= mid){
          update(2 * node, l, mid, pos, v);
        }
        else {
          update(2 * node + 1, mid + 1, r, pos, v);
        }
        segTree[node] = max(segTree[2 * node], segTree[2 * node + 1]);
    }
}
void query(int node, int l, int r, int x, int y, int &ans){
    if(x <= l && r <= y){
        ans = max(ans, segTree[node]);
    }
    else {
        int mid = (l + r) / 2;
        if(x <= mid)
          query(2 * node, l, mid, x, y, ans);
        if(y > mid)
          query(2 * node + 1, mid + 1, r, x, y, ans);
    }
}
int main(){
    int n, m;
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
       fin >> val[i];
    build(1, 1, n);
    for(int i = 0; i < m; i++){
        int op, a, b;
        fin >> op >> a >> b;
        if(op == 0){
          int maxx = -1;
          query(1, 1, n, a, b, maxx);
          fout << maxx << '\n';
        }
        else {
          update(1, 1, n, a, b);
        }
    }
    fin.close();
    fout.close();
    return 0;
}