#include <iostream>
#include <cstdio>
#define LL long long
using namespace std;
int N,M;
int val,op,a,b;
LL A[400005];
void update(int nod,int st,int dr,int poz,LL val)
{
    if(st==dr)  {A[nod]=val;return;}
    LL mid=(st+dr)/2;
    if(poz<=mid)
    {
        update(2*nod,st,mid,poz,val);
    }
    else
    {
        update(2*nod+1,mid+1,dr,poz,val);
    }
    A[nod]=max(A[2*nod],A[2*nod+1]);
}
LL query(int nod,int st,int dr,int X,int Y)
{
    if(Y<X) return 0;
    if(X<=st&&dr<=Y)
        return A[nod];
    LL mid=(st+dr)/2;
    if(mid>=Y)  return query(2*nod,st,mid,X,Y);
    else if(mid<X) return query(2*nod+1,mid+1,dr,X,Y);
    else return max(query(2*nod,st,mid,X,Y),query(2*nod+1,mid+1,dr,X,Y));
}
int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    cin>>N>>M;
    for(int i=1;i<=N;i++)
    {
        cin>>val;
        update(1,1,N,i,val);
    }
    for(int i=1;i<=M;i++)
    {
        cin>>op>>a>>b;
        if(!op)
            cout<<query(1,1,N,a,b)<<"\n";
        else
            update(1,1,N,a,b);
    }
    return 0;
}