#include <iostream>
#include <fstream>
using namespace std;
const int inf = 1000010;
int ans, arbint[400010], v[100010];

void build (int node, int left, int right)
{
    if(left==right)
        arbint[node]=v[left];
    else
    {
        int mij=(left+right)/2;
        build(2*node,left,mij);
        build(2*node+1,mij+1,right);
        arbint[node]=max(arbint[2*node],arbint[2*node+1]);
    }
}

void insrt (int x, int y, int node, int left, int right)
{
    if(left==right)
        arbint[node]=y;
    else
    {
        int mij = (left+right)/2;
        if(x>mij)
            insrt(x,y,2*node+1,mij+1,right);
        else
            insrt(x,y,2*node,left,mij);
        arbint[node]=max(arbint[2*node],arbint[2*node+1]);
    }
}
int query (int x, int y, int node, int left, int right)
{
    if(left>=x&&right<=y)
        return arbint[node];
    else
    {
        int ans=-inf;
        int mij= (left+right)/2;
        if(y>mij)
            ans=max(ans,query(x,y,2*node+1,mij+1,right));
        if(x<=mij)
            ans=max(ans,query(x,y,2*node,left,mij));
            return ans;
    }
}
int main()
{
    ifstream fin ("arbint.in");
    ofstream fout ("arbint.out");
    int n,m,i,a,x,q,b;
    fin>>n>>m;
    for(i=1; i<=n; i++)
        fin>>v[i];
    build(1,1,n);
    for(i=1; i<=m; i++)
    {
        fin>>q>>a>>b;

        if(q==0)
            fout<<query(a,b,1,1,n)<<"\n";
        if(q==1)
            insrt(a,b,1,1,n);
    }
    return 0;
}