#include <fstream>
#include <cmath>
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
int n,lastnode;
int v[100005];
int tree[300000];
void buildtree(int l=1,int r=lastnode,int node=1)
{
    if(l==r && l<=n)
    {
        tree[node]=v[l];
        return;
    }
    else if(l==r && l>n)
    {
        tree[node]=0;
        return;
    }
    int med=(l+r)/2;
    buildtree(l,med,2*node);
    buildtree(med+1,r,2*node+1);
    tree[node]=max(tree[2*node],tree[2*node+1]);
}
void update(int poza,int val,int l=1,int r=lastnode,int node=1)
{
    if(l==r)
    {
        tree[node]=val;
        return;
    }
    int med=(l+r)/2;
    if(poza<=med)
        update(poza,val,l,med,node*2);
    else
        update(poza,val,med+1,r,node*2+1);
    tree[node]=max(tree[node*2],tree[node*2+1]);
}
int query(int searchl,int searchr,int l=1,int r=lastnode,int node=1)
{
    int maxi=-1;
    int maxl=0;
    if(searchl<=l && searchr>=r)
        return tree[node];
    int med=(l+r)/2;
    if(searchl<=med)
        maxi=max(maxi,query(searchl,searchr,l,med,2*node));
    if(searchr>med)
       maxi=max(maxi,query(searchl,searchr,med+1,r,2*node+1));
    return maxi;
}
int main()
{
    int q;
    in>>n>>q;
    for(int i=1;i<=n;i++)
        in>>v[i];
    int nrlevel=log2(n);
    nrlevel+=((1<<nrlevel)<n);
    lastnode=(1<<nrlevel);
    buildtree();
    /*for(int i=1;i<=((1<<(nrlevel+1))-1);i++)
        out<<tree[i]<<' ';*/
    for(int i=1;i<=q;i++)
    {
        int a,b;
        bool type;
        in>>type>>a>>b;
        if(type==0)
            out<<query(a,b)<<'\n';
        else
            update(a,b);
    }
    return 0;
}