#include <iostream>
#include <fstream>
using namespace std;
int n,m,finish,start,x,pos,val,Maxarb[10000000],maxim,a,b;
ifstream f("arbint.in");
ofstream g("arbint.out");
void update(int nod, int left,int right)
{
    if (left==right)
    {
        Maxarb[nod]=val;
        return;
    }
    int div=(left+right)/2;
    if (pos<=div) update(nod*2,left,div);
    else update(nod*2+1,div+1,right);
    Maxarb[nod]=max(Maxarb[2*nod+1],Maxarb[2*nod]);
}
void query(int nod,int left,int right)
{
    if (start<=left&&right<=finish)
    {
        if (maxim<Maxarb[nod]) maxim=Maxarb[nod];
        return;
    }
     int div = (left+right)/2;
     if ( start <= div ) query(2*nod,left,div);
     if ( div < finish ) query(2*nod+1,div+1,right);
}
int main()
{
    f>>n>>m;
    for (int i=1;i<=n;i++)
    {
        f>>x;
        pos=i;
        val=x;
        update(1,1,n);
    }
    for (int i=1;i<=m;i++)
    {
        f>>x>>a>>b;
        if (x==0)
        {
            start=a;
            finish=b;
            maxim=-1;
            query(1,1,n);
            g<<maxim<<'\n';
        }
        else
        {
            pos=a;
            val=b;
            update(1,1,n);
        }
    }
}