#include <iostream>
#include <fstream>
#define NMAX 100005
using namespace std;

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

int n, m, op, a, b, x, maxim;
int arb[4*NMAX+1000];

void update(int nodcrt, int left, int right, int poz, int val)
{
    if(left==right)
    {
        arb[nodcrt]=val;
        return;
    }
    int middle=(left+right)/2;
    if(middle>=poz)
        update(2*nodcrt, left, middle, poz, val);
    else
        update(2*nodcrt+1, middle+1, right, poz, val);
    arb[nodcrt]=max(arb[2*nodcrt], arb[2*nodcrt+1]);
}

void query (int nodcrt, int left, int right, int a, int b)
{
    if(a<=left && right<=b)
    {
        if(maxim<arb[nodcrt])
            maxim=arb[nodcrt];
        return;
    }
    int middle=(left+right)/2;
    if(a<=middle)
        query(2*nodcrt, left, middle, a, b);
    if(middle<b)
        query(2*nodcrt+1, middle+1, right, a, b);
}

int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; i++){
        fin>>x;
        update(1, 1, n, i, x);
    }
    for(int i=1; i<=m; i++)
    {
        fin>>op>>a>>b;
        if(op==0){
            maxim=0;
            query(1, 1, n, a, b);
            fout<<maxim<<"\n";
        }
        else
            update(1, 1, n, a, b);
    }
    return 0;
}