#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("arbint.in");
ofstream fout("arbint.out");

int n,m,a,b,val,tree[400010],type;

void update(int node, int left, int right, int pos, int val)
{
    if(left==right)
    {
        tree[node]=val;
        return;
    }
    int mid=(left+right)/2;
    if(pos<=mid)
        update(2*node,left,mid,pos,val);
    else
        update(2*node+1,mid+1,right,pos,val);
    tree[node]=max(tree[2*node],tree[2*node+1]);
}

int query(int node, int left, int right, int st, int dr)
{
    if(st<=left && right<=dr)
        return tree[node];
    int mid=(left+right)/2,s=0,d=0;
    if(st<=mid)
        s=query(2*node,left,mid,st,dr);
    if(mid<dr)
        d=query(2*node+1,mid+1,right,st,dr);
    return max(s,d);
}

int main()
{
    fin >> n >> m;
    for(int i=1;i<=n;i++)
    {
        fin >> val;
        update(1,1,n,i,val);
    }
    for(;m;--m)
    {
        fin >> type >> a >> b;
        if(type==0)
            fout << query(1,1,n,a,b) << '\n';
        else
            update(1,1,n,a,b);
    }
    return 0;
}