#include <fstream>
using namespace std;

int n,m;
ifstream fin("arbint.in");
ofstream fout("arbint.out");

const int INF = 1e9+5;
const int sz = 100000;

int a[sz*4+5];

void build(int nod,int st,int dr)
{
    if(st==dr) {fin>>a[nod]; return;}
    int mid = (st+dr)/2;
    build(nod*2,st,mid);
    build(nod*2+1,mid+1,dr);
    a[nod]=max(a[nod*2],a[nod*2+1]);
}
void update(int nod,int st,int dr,int poz,int val)
{
    if(st==dr){a[nod] = val; return;}
    int mid = (st+dr)/2;
    if(poz <= mid) update(nod*2,st,mid,poz,val);
    else update(nod*2+1,mid+1,dr,poz,val);
    a[nod]=max(a[nod*2],a[nod*2+1]);
}
int query(int nod,int st,int dr,int x,int y)
{
    if(x<=st && dr<=y)  return a[nod];
    int mid = (st+dr)/2;
    int s1 = 0;
    int s2 = 0;
    if(x<=mid)
        s1 = query(nod*2,st,mid,x,y);
    if(y>mid)
        s2 = query(nod*2+1,mid+1,dr,x,y);
    return max(s1,s2);
}

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