#include <algorithm>
using namespace std;

#define DIM 100005

int aint[DIM<<2];
int n,m;

void update (int nod,int st,int dr,int poz,int val)
{
    int mij;

    if (st==dr)
    {
        aint[nod]=val;
        return ;
    }
    mij=(st+dr)>>1;
    if (poz<=mij)
        update (nod<<1,st,mij,poz,val);
    else
        update ((nod<<1)|1,mij+1,dr,poz,val);
    aint[nod]=max (aint[nod<<1],aint[(nod<<1)|1]);
}

void read ()
{
    int i,x;

    scanf ("%d%d",&n,&m);
    for (i=1; i<=n; ++i)
    {
        scanf ("%d",&x);
        update (1,1,n,i,x);
    }
}

int query (int nod,int st,int dr,int in,int sf)
{
    int mij,val;

    if (in<=st && dr<=sf)
        return aint[nod];

    val=0; mij=(st+dr)>>1;
    if (in<=mij)
        val=max (val,query (nod<<1,st,mij,in,sf));
    if (mij<sf)
        val=max (val,query ((nod<<1)|1,mij+1,dr,in,sf));
    return val;
}

void solve ()
{
    int i,tip,a,b;

    for (i=1; i<=m; ++i)
    {
        scanf ("%d%d%d",&tip,&a,&b);
        if (!tip)
            printf ("%d\n",query (1,1,n,a,b));
        else
            update (1,1,n,a,b);
    }
}

int main ()
{
    freopen ("arbint.in","r",stdin);
    freopen ("arbint.out","w",stdout);

    read ();
    solve ();

    return 0;
}