#include <bits/stdc++.h>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int tree[400010],v[100010],i,j,n,m,poz,val,a,b,sum,op;
void build(int node,int left,int right)
{
    if(left==right)
    {
        tree[node]=v[left];
        return;
    }
    build(node*2,left,(left+right)/2);
    build(node*2+1,(left+right)/2+1,right);
    tree[node]=max(tree[node*2],tree[node*2+1]);
}
void update(int node,int left,int right)
{
    if(left==right)
    {
        tree[node]=val;
        return;
    }
    int mij=(left+right)/2;
    if(poz<=mij)
        update(node*2,left,mij);
    else update(node*2+1,mij+1,right);
    tree[node]=max(tree[node*2],tree[node*2+1]);
}
void query(int node,int left,int right)
{
    if(a<=left && right<=b)
    {
        sum=max(tree[node],sum);
        return;
    }
    int mij=(left+right)/2;
    if(a<=mij)
        query(node*2,left,mij);
    if(mij<b)
        query(node*2+1,mij+1,right);
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
        fin>>v[i];
    build(1,1,n);
    for(i=1;i<=m;i++)
    {
        fin>>op>>a>>b;
        if(op==0)
        {
            sum=0;
            query(1,1,n);
            fout<<sum<<'\n';
        }
        else
        {
            poz=a;
            val=b;
            update(1,1,n);
        }
    }
    return 0;
}