#include <iostream>
#include <cstdio>
#define MAXN 100001
int aint[4*MAXN];
int stq,drq;
int query(int nod,int st,int dr)
{
    if(stq<=st && drq>=dr)
        return aint[nod];
    if(drq<st || stq>dr)
        return 0;
    int mid=(st+dr)>>1;
    return std::max(query(2*nod,st,mid),query(2*nod+1,mid+1,dr));
}
void update(int nod,int st,int dr)
{
    if(st==dr)
        aint[nod]=drq;
    else
    {
        int mid=(st+dr)>>1;
        if(stq<=mid)
            update(2*nod,st,mid);
        else
            update(2*nod+1,mid+1,dr);
        aint[nod]=std::max(aint[2*nod],aint[2*nod+1]);
    }
}
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(stq=1;stq<=n;stq++)
    {
        fscanf(fin,"%d",&drq);
        update(1,1,n);
    }
    for(int i=0;i<m;i++)
    {
        fscanf(fin,"%d%d%d",&tip,&stq,&drq);
        if(!tip)
            fprintf(fout,"%d\n",query(1,1,n));
        else
            update(1,1,n);
    }
    fclose(fin);
    fclose(fout);
    return 0;
}