#include <fstream>

using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
int arb[400005],n,m,poz,val,a,b,maxim;

void update(int nod,int left, int right)
{
    if (left==right) arb[nod]=val;
    else
    {
        int mij=(left+right)/2;
        if (poz<=mij) update (2*nod,left,mij);
        else update (2*nod+1,mij+1,right);
        arb[nod]=max(arb[2*nod],arb[2*nod+1]);
    }
}
void query(int nod,int left,int right)
{
    if (a<=left&&right<=b)
        maxim=max(maxim,arb[nod]);
    else
    {
        int mij=(left+right)/2;
        if (mij>=a)
            query(2*nod,left,mij);
        if (mij<b)
            query(2*nod+1,mij+1,right);
    }
}
int main()
{
    int op,x,y;
    in>>n>>m;
    for (int i=1; i<=n; i++)
    {
        in>>val;
        poz=i;
        update(1,1,n);
    }
    for (int i=1; i<=m; i++)
    {
        in>>op>>x>>y;
        if (!op)
        {
            a=x;
            b=y;
            maxim=-1;
            query(1,1,n);
            out<<maxim<<'\n';
        }
        else
        {
            poz=x;
            val=y;
            update(1,1,n);
        }
    }
    return 0;
}