#include <fstream>

using namespace std;

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

int n, m;
int poz, val, rez;
int start, finish;
int arbore[262144];

void Update (int nod, int st, int dr)
{
    if (st == dr)
    {
        arbore[nod] = val;
        return;
    }

    int mij = (st + dr) / 2;

    if (poz <= mij)
        Update(nod*2, st, mij);
    else Update(nod*2+1, mij+1, dr);

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

void Querry (int nod, int st, int dr)
{
    if (start <= st && finish >= dr)
    {
        rez = max(rez, arbore[nod]);
        return;
    }

    int mij = (st + dr) / 2;

    if (start <= mij)
        Querry(nod*2, st, mij);
    if (mij+1 <= finish)
        Querry(nod*2+1, mij+1, dr);
}

int main()
{
   f >> n >> m;

   for (int i=1; i<=n; i++)
   {
       f >> val;
       poz = i;
       Update(1, 1, n);
   }

   while (m --)
   {
       int cerinta;
       f >> cerinta >> start >> finish;

       if (cerinta == 0)
       {
           rez = 0;
           Querry(1, 1, n);
           g << rez << "\n";
       }
       else
       {
           poz = start, val = finish;
           Update(1, 1, n);
       }
   }

    return 0;

}