#include <iostream>
#include <fstream>
using namespace std;
ifstream f("arbint.in");
ofstream g ("arbint.out");
int n,m,mx_rasp;
int x,arbore[400011];
void adaugare(int nr,int indice_v,int st,int dr,int indice_ar)
{
    if(st == dr)
    {
        arbore[indice_ar] = nr;
        return;
    }
    int mij = (st+dr)/2;
    if(indice_v<=mij)
    {
        adaugare(nr,indice_v,st,mij,indice_ar*2);
    }
    else
        adaugare(nr,indice_v,mij+1,dr,indice_ar*2+1);
    arbore[indice_ar] = max(arbore[indice_ar*2],arbore[indice_ar*2+1]);
}
void query(int st_int,int dr_int,int st,int dr,int indice_arb)
{
    if(st_int<=st && dr_int>=dr)
    {
        mx_rasp = max(mx_rasp,arbore[indice_arb]);
        return;
    }
    int mij = (st+dr)/2;
    if(st_int<=mij)
    {
        query(st_int,dr_int,st,mij,indice_arb*2);
    }
    if(dr_int>mij)
       query(st_int,dr_int,mij+1,dr,indice_arb*2+1);
}
void citire()
{
    f >> n >> m;
    for(int i = 1;i<=n;i++)
    {
        f >> x;
        adaugare(x,i,1,n,1);
    }
}
int main()
{
    citire();
    int c,a,b;
    for(int i = 1;i<=m;i++)
    {
        f >> c >> a >> b;
        if(c == 0)
        {
            mx_rasp = 0;
            query(a,b,1,n,1);
            g<<mx_rasp<< endl;
        }
        else
            adaugare(b,a,1,n,1);
    }
}