#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;
vector<int>arb;
void update(int poz)
{
    if(poz==0)
    {
        return;
    }
    arb[poz]=max(arb[poz*2+1],arb[poz*2]);
    update(poz/2);
}

int querry(int capat_st,int capat_dr,int caut_st, int caut_dr,int poz)
{
    if(caut_dr<capat_st || capat_dr<caut_st)
        return 0;
    if(caut_st<=capat_st && caut_dr>=capat_dr)
    {
              return arb[poz];
    }

    int mij=(capat_st+capat_dr)/2;
    return max(querry(capat_st,mij,caut_st,caut_dr,poz*2),querry(mij+1,capat_dr,caut_st,caut_dr,poz*2+1));

}
int main()
{
    int op,a,b;
    int capat_dr,capat_st,caut_st,caut_dr,n,m,val;
    cin>>n>>m;
    int log2n=log2(n);
    log2n+=((1<<log2n)<n);
    int abs_dr=(1<<log2n);
    arb.resize(abs_dr*2+1);
    capat_dr=abs_dr;
    capat_st=1;
    for(int i=1;i<=n;i++)
    {
        cin>>val;
        arb[abs_dr+i-1]=val;
        update((abs_dr+i-1)/2);
    }
    for(int i=1;i<=m;i++)
    {
        cin>>op>>a>>b;
        if(op==0)
        {
            cout<<querry(capat_st,capat_dr,a,b,1)<<"\n";
        }
        else if(op==1)
        {
            arb[abs_dr+a-1]=b;
            update((abs_dr+a-1)/2);
            for(int j=1;j<=abs_dr*2-1;j++)
            {
              cout<<arb[j]<<" ";
            }
            cout<<"\n";
        }
    }
}