#include <fstream>
//i hate nightmares
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
int st[400002];
void update(int node,int from,int to, int pos,int val)
{
    if(from==to)
    {
        st[node]=val;
        return ;
    }
    int mid=(from+to)/2;
    if(pos<=mid)
        update(node*2,from,mid,pos,val);
    else
        update(node*2+1, mid+1,to,pos,val);
    st[node]=max(st[node*2],st[node*2+1]);
}
int query(int node, int from, int to, int qleft, int qright)
{
    int smax=0;
    if(qleft<=from && to<=qright)
        return st[node];

    int mid=(from+to)/2;
    if(qleft<=mid)
    {
        int s=query(node*2, from, mid, qleft, qright);
        smax=max(smax, s);
    }
    if(mid+1<=qright)
    {
        int s=query(node*2+1, mid+1, to, qleft, qright);
        smax=max(smax, s);
    }
    return smax;
}
int main()
{
    int n,m,x;
    in>>n>>m;
    for(int i=1;i<=n;i++)
        in>>x,update(1,1,n,i,x);
    int qtype,a,b;
    for(int i=0;i<n;i++)
    {
        in>>qtype>>a>>b;
        if(qtype==0)
            out<<query(1,1,n,a,b)<<'\n';
        else
            update(1,1,n,a,b);
    }
    return 0;
}