#include <cstdio>
#include <algorithm>
using namespace std;
const int Maxn=100001;
int aint[4*Maxn],a,b;
void update(int nod,int st,int dr)
{
    if(st==dr)
        aint[nod]=b;
    else
    {
        int mid=(st+dr)>>1;
        if(a<=mid)
            update(2*nod,st,mid);
        else
            update(2*nod+1,mid+1,dr);
        aint[nod]=max(aint[2*nod],aint[2*nod+1]);
    }
}
int query(int nod,int st,int dr)
{
    if(a<=st && dr<=b)
        return aint[nod];
    if(b<st || dr<a)
        return 0;
    int mid=(st+dr)>>1;
    return max(query(2*nod,st,mid),query(2*nod+1,mid+1,dr));
}
int main()
{
    FILE *fin,*fout;
    fin=fopen("arbint.in","r");
    fout=fopen("arbint.out","w");
    int n,m,tip;
    fscanf(fin,"%d%d",&n,&m);
    for(a=1;a<=n;a++)
    {
        fscanf(fin,"%d",&b);
        update(1,1,n);
    }
    for(int i=0;i<m;i++)
    {
        fscanf(fin,"%d%d%d",&tip,&a,&b);
        if(!tip)
            fprintf(fout,"%d\n",query(1,1,n));
        else
            update(1,1,n);
    }
    fclose(fin);
    fclose(fout);
    return 0;
}