#include <cstdio>
#define NMAX 100001
using namespace std;
FILE* fin=fopen("arbint.in","r");
FILE* fout=fopen("arbint.out","w");
long long int arb[NMAX],start,finish,pos,val,maxim,n,m;
long long int Maxim(long long int a,long long int b)
{
    if (a>b) return a; return b;
}
void update(long long int nod,long long int st,long long int dr);
void query(long long int nod,long long int st,long long int dr);
int main()
{
    long long int i,a,b,x;
    fscanf (fin,"%lld %lld",&n,&m);
    for (i=1; i<=n; i++)
    {
        fscanf(fin,"%lld",&val);
        pos=i;
        update(1,1,n);
    }
    for (i=1; i<=m; i++)
    {
        fscanf(fin,"%lld %lld %lld",&x,&a,&b);
        if (x==0)
        {
            maxim=-1;
            start=a; finish=b;
            query(1,1,n);
            fprintf(fout,"%lld\n",maxim);
        }
        else
        {
            pos=a; val=b;
            update(1,1,n);
        }
    }

    return 0;
}
void update(long long int nod,long long int st,long long int dr)
{
    if (st==dr)
    {
        arb[nod]=val;
        return;
    }
    long long int mijloc=(st+dr)/2;
    if (pos<=mijloc)
        update(2*nod,st,mijloc);
    else update (2*nod+1,mijloc+1,dr);

    arb[nod]=Maxim(arb[2*nod],arb[2*nod+1]);
}
void query(long long int nod,long long int st,long long int dr)
{
    if (start<=st && dr<=finish)
    {
        if (maxim<arb[nod]) maxim=arb[nod];
        return;
    }
    long long int mijloc=(st+dr)/2;
    if (start<=mijloc) query(2*nod,st,mijloc);
    if (mijloc<finish) query(2*nod+1,mijloc+1,dr);
}