#include <iostream>
#include <fstream>
using namespace std;
int arb[400010], val, p, x, y, pos, maxim,start, finish, i, n, m;
void update(int nod, int left, int right)
{
    if(left==right)
    {
        arb[nod]=val;
        return;
    }

    int mij=(left+right)/2;
    if(pos<=mij) update(2*nod, left, mij);
    else update(2*nod+1, mij+1, right);
    arb[nod]=max(arb[2*nod], arb[2*nod+1]);
}
void query(int nod, int left, int right)
{
    if(start<=left&&finish>=right)
    {
        if(maxim<arb[nod]) maxim=arb[nod];
        return;
    }
    int mij=(left+right)/2;
    if(mij>=start) query(2*nod, left, mij);
    if(mij<finish) query(2*nod+1, mij+1, right);
}
int main()
{
    ifstream fin("arbint.in");
    ofstream fout("arbint.out");
    fin>>n>>m;
    for(i=1; i<=n; i++)
    {
        fin>>val;
        pos=i;
        update(1,1,n);
    }
    for(i=1; i<=m; i++)
    {
        fin>>p>>x>>y;
        if(p==0)
        {
            maxim=-1;
            start=x;
            finish=y;
            query(1, 1, n);
            fout<<maxim<<"\n";
        }
        if(p==1)
        {
            pos=x;
            val=y;
            update(1, 1, n);
        }
    }
    return 0;
}