#include <bits/stdc++.h>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
const int NMAX=100005;
int n,Q,op,pos,val,start,finish,ans,v[NMAX],MaxTree[2*NMAX];
void build(int node,int left,int right)
{
    if(left==right)///leaf
    {
        MaxTree[node]=v[left];
        return;
    }
    int middle=(left+right)/2;
    build(node+1,left,middle);///build left son
    build(node+2*(middle-left+1),middle+1,right);///build right son
    MaxTree[node]=max(MaxTree[node+1],MaxTree[node+2*(middle-left+1)]);
}
void update(int node,int left,int right)
{
    if(left==right)///leaf
    {
        MaxTree[node]=val;
        return;
    }
    int middle=(left+right)/2;
    if(pos<=middle)
        update(node+1,left,middle);///update left son
    else
        update(node+2*(middle-left+1),middle+1,right);///update right son
    MaxTree[node]=max(MaxTree[node+1],MaxTree[node+2*(middle-left+1)]);
}
void query(int node,int left,int right)
{
    if(start<=left && right<=finish)///verify if the current interval is inside the one from the query
    {
        ans=max(ans,MaxTree[node]);
        return;
    }
    int middle=(left+right)/2;
    if(start<=middle)
        query(node+1,left,middle);///query left son
    if(middle<finish)
        query(node+2*(middle-left+1),middle+1,right);///query right son
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    f>>n>>Q;
    for(int i=1;i<=n;i++)
        f>>v[i];
    build(1,1,n);
    for(int q=1;q<=Q;q++)
    {
        f>>op;
        if(op==1)
        {
            f>>pos>>val;
            update(1,1,n);
        }
        else
        {
            f>>start>>finish;
            ans=0;
            query(1,1,n);
            g<<ans<<'\n';
        }
    }
    return 0;
}