#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("arbint.in");
ofstream fout ("arbint.out");
const int nmax = 100005;
int n, m, arb[4*nmax], start, finish, pos, val, maxx;
void update(int nod, int left, int right)
{
    if(left==right)
    {
        arb[nod]=val;
        return;
    }
    int mid=(left+right)/2;
    if(pos <= mid) update(2*nod, left, mid);
    else update(2*nod+1, mid+1, right);

    arb[nod]=max(arb[2*nod], arb[2*nod+1]);
}
void query(int nod, int left, int right)
{
    if(start<=left && right<=finish)
    {
        maxx=max(arb[nod], maxx);
        return;
    }
    int mid=(left+right)/2;
    if(start<=mid) query(2*nod, start, mid);
    if(mid<finish) query(2*nod+1, mid+1, finish);
}
int main()
{
    int i, op, x, a, b;
    fin >> n >> m;
    for(i=1; i<=n; i++)
    {
        fin >> x;
        pos=i;
        val=x;
        update(1, 1, n);
    }

    for(i=1; i<=m; i++)
    {
        fin >> op >> a >> b;
        if(op==0)
        {
            maxx=-1;
            start=a;
            finish=b;
            query(1, 1, n);
            fout << maxx << "\n";
        }
        else
        {
            pos=a;
            val=b;
            update(1, 1, n);
        }
    }
    fin.close();
    fout.close();
    return 0;
}