#include <bits/stdc++.h>
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
int n,m,arb[200064],mx,val,ind,start,finish,var,a,b;
void query(int nod, int left, int right)
{
    if(start <= left && right <= finish)
    {
        mx=max(mx,arb[nod]);
        return;
    }
    int mij=(left+right)/2;
    if(start<=mij)query(nod*2,left,mij);
    if(mij<finish)query(nod*2+1,mij+1,finish);
}
void update(int nod, int left, int right)
{
    if(left==right)
    {
        arb[nod]=val;
        return;
    }
    int mij=(left+right)/2;
    if(ind<=mij)update(nod*2,left,mij);
    else update(nod*2+1,mij+1,right);
    arb[nod]=max(arb[nod*2],arb[nod*2+1]);
}
int main()
{
    in>>n>>m;

    for(int i=1;i<=n;++i)
    {
        in>>val;
        ind=i;
        update(1,1,n);
    }
    for(int i=1;i<=m;++i)
    {
        in>>var>>a>>b;
        if(var==0)
        {
            mx=-1;
            start=a,finish=b;
            query(1,1,n);
            out<<mx<<'\n';
        }
        else{
            ind=a,val=b;
            update(1,1,n);
        }
    }

    return 0;
}