#include <fstream>
#define NMAX 100005

using namespace std;

const char inname[] = "arbint.in";
const char outname[] = "arbint.out";
ifstream fin(inname);
ofstream fout(outname);

void init(int, int, int);
int query(int, int, int, int, int);
void update(int, int, int, int);

int n, m, i, nr[NMAX], arb[NMAX*4], op, a, b;

int main(){
    fin >> n >> m;
    for(i=1; i<=n; i++)
        fin >> nr[i];
    init(1, 1, n);
    for(i=1; i<=m; i++){
        fin >> op >> a >> b;
        if(op==0)
            fout << nr[query(1, 1, n, a, b)] << '\n';
            else if(op==1){
                nr[a] = b;
                update(1, 1, n, a);
                }
        }
    fin.close();
    fout.close();
    return 0;
}

void init(int node, int st, int dr){
    int mij = (st+dr)/2;
    if(st == dr)
        arb[node] = st;
        else{
            init(2*node, st, mij);
            init(2*node+1, mij+1, dr);
            if(nr[arb[2*node]] >= nr[arb[2*node+1]])
                arb[node] = arb[2*node];
                else
                arb[node] = arb[2*node+1];
            }
}

int query(int node, int st, int dr, int a, int b){
    int mij = (st+dr)/2, p1, p2;
    if(a > dr || b < st)
        return -1;
    if(st >= a && dr<=b)
        return arb[node];
    p1 = query(node*2, st, mij, a, b);
    p2 = query(node*2+1, mij+1, dr, a, b);
    if(p1 == -1) return p2;
    if(p2 == -1) return p1;
    if(nr[p1] >= nr[p2])
        return p1;
    return p2;
}

void update(int node, int st, int dr, int pos){
    int mij = (st+dr)/2;
    if(st == dr) return;
    if(pos <=mij)
        update(2*node, st, mij, pos);
        else
        update(2*node+1, mij+1, dr, pos);
    if(nr[arb[2*node]] >= nr[arb[2*node+1]])
        arb[node] = arb[2*node];
        else
        arb[node] = arb[2*node+1];
}