#include <iostream>
#include<bits/stdc++.h>

using namespace std;

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


int arbore[4*100001];
int v[100001],n;

void creaza_arbore(int indx,int st,int dr)
{
    if(st==dr)
    {
        arbore[indx] = v[st];
    }
    else
    {
        int mij = (st+dr)/2;
        creaza_arbore(indx*2,st,mij);
        creaza_arbore(indx*2+1,mij+1,dr);
        arbore[indx] = max(arbore[indx*2],arbore[indx*2+1]);
    }
}

int maxim(int indx,int st,int dr,int start,int finish)
{
    if(start<=st&&finish>=dr)
    {
        return arbore[indx];
    }
    else
    {
        int mij = (st+dr)/2;
        int m1=-1,m2=-1;
        if(start<=mij)
            m1 = maxim(indx*2,st,mij,start,finish);
        else
            m1 = maxim(indx*2+1,mij+1,dr,start,finish);
        if(finish>mij)
            m2 = maxim(indx*2+1,mij+1,dr,start,finish);
        else
            m2 =  maxim(indx*2,st,mij,start,finish);
        return max(m1,m2);
    }
}

void insereaza(int indx,int st,int dr,int val,int poz)
{
    if(st==dr)
    {
        arbore[indx] = val;
    }
    else
    {
        int mij = (st+dr)/2;
        if(poz<=mij)
            insereaza(indx*2,st,mij,val,poz);
        else
            insereaza(indx*2+1,mij+1,dr,val,poz);
        arbore[indx] = max(arbore[indx*2],arbore[indx*2+1]);
    }

}

int main()
{
    int m,x,y,z;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        fin>>v[i];

    creaza_arbore(1,1,n);
    for(int i=0;i<m;i++)
    {

        fin>>x>>y>>z;
        if(x==0)
            fout<<maxim(1,1,n,y,z)<<"\n";
        else
            insereaza(1,1,n,z,y);


    }

    return 0;
}