#include <fstream>
#include <iostream>
using namespace std;

ifstream f("arbint.in");
ofstream g("arbint.out");

int val, m, poz, n, k, arb[4 * 100005], maxx, st, dr;

void Update(int nod, int left, int right)
{
    int m;
    if(left == right)
    {
        arb[nod] = val;
        return;
    }
    m = (left + right) >> 1;
    if(poz <= m) Update(2 * nod, left, m);
    else Update(2 * nod + 1, m + 1, right);

    arb[nod] = max(arb[2 * nod], arb[2 * nod + 1]);

}

void Query(int nod, int left, int right)
{
    if(st <= left && right <= dr)
    {
        maxx = max(maxx, arb[nod]);
        return;
    }
    int m = (left + right)/2;
    if(st <= m) Query(2 * nod, left, m);
    if(m < dr) Query(2 * nod + 1, m + 1, right);
}

int main()
{
    int  query, x, y;
    f >> n >> m;
    for(int i = 1; i <= n; ++i)
    {
        f >> x;
        val = x;
        poz = i;
        Update(1, 1, n);
    }
    for(int i = 1; i <= m; ++i)
    {
        f >> query >> x >> y;
        if(!query)
        {
            maxx = -1;
            st = x;
            dr = y;
            Query(1, 1, n);
            g << maxx << '\n';
        }
        else
        {
            poz = x;
            val = y;
            Update(1, 1, n);
        }
    }
}