#include <fstream>
#define N 100001
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");

int aint[5*N];
int n,m;
void Actualizare(int nod,int st,int dr,int poz,int val)
{
    if(st==dr)
    {
        aint[nod] = val;
        return;
    }
    int mij = (st+dr)/2;
    if(poz<=mij)
        Actualizare(2*nod,st,mij,poz,val);
    else
        Actualizare(2*nod+1,mij+1,dr,poz,val);
    aint[nod] = max(aint[2*nod],aint[2*nod+1]);
}
int Query(int nod,int st,int dr,int a,int b)
{
    if(a<=st&&dr<=b)
        return aint[nod];
    int mij = (st+dr)/2;
    int maxx = 0;
    if(a<=mij)
        maxx = max(maxx,Query(2*nod,st,mij,a,b));
    if(b>mij)
        maxx = max(maxx, Query(2*nod+1,mij+1,dr,a,b));
    return maxx;
}

int main()
{
    int x,cer,y;
    cin>>n>>m;
    for(int i=1;i<=n;++i)
        cin>>x,Actualizare(1,1,n,i,x);
    for(int k=1;k<=m;++k)
    {
        cin>>cer;
        if(cer==0)
        {
            cin>>x>>y;
            cout<<Query(1,1,n,x,y)<<'\n';
        }
        else
        {
            cin>>x>>y;
            Actualizare(1,1,n,x,y);
        }
    }
    return 0;
}