#include <bits/stdc++.h>
#define N 100005

using namespace std;

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

int a, b, poz, val, t[N];

void actualizare(int p, int st, int dr){
    if(st == dr){
        t[p] = val;
        return;
    }
    int m = (st+dr)/2, fst = 2*p, fdr = 2*p+1;
    if(poz <= m){
       actualizare(fst, st, m);
    }else{
        actualizare(fdr, m+1, dr);
    }
    t[p] = max(t[fst], t[fdr]);
}

int interogare(int p, int st, int dr)
{
    if(a <= st && dr <= b){
        return t[p];
    }
    int m = (st+dr)/2, rezst = 0, rezdr = 0, fst = 2*p, fdr = 2*p+1;
    if(a <= m){
        rezst = interogare(fst, st, m);
    }
    if(m < b){
        rezdr = interogare(fdr, m+1, dr);
    }
    return max(rezst, rezdr);
}

int main()
{
    int M, n, i, tip;
    in >> n >> M;
    for(i = 1; i <= n; i++)
    {
        in >> val;
        poz = i;
        actualizare(1, 1, n);
    }
    for(i = 1; i <= M; i++){
        in >> tip >> a >> b;
        poz = a;
        val = b;
        if(tip == 0){
           out << interogare(1, 1, n) << '\n';
        }
        else{
            actualizare(1,1,n);
        }
    }
    return 0;
}