#include <bits/stdc++.h>
#define Nmax 100005
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int N, M;
int v[Nmax];
int arb[Nmax * 4 + 5];
int cer, a, b;
int maxim;
void build(int k, int left, int right)
{
    if(left == right)
    {
        arb[k] = v[left];
        return;
    }
    int mid = (left + right) / 2;
    build(2 * k, left, mid);
    build(2 * k + 1, mid + 1, right);
    arb[k] = max(arb[2 * k], arb[2 * k + 1]);
}
void update(int k, int left, int right, int poz, int val)
{
    if(left == right)
    {
        arb[k] = val;
        return;
    }
    int mid = (left + right) / 2;
    if(poz <= mid)
    {
        ///in partea stanga
        update(2 * k, left, mid, poz, val);
    }
    else
    {
        ///in partea dreapta
        update(2 * k + 1, mid + 1, right, poz , val);
    }
    arb[k] = max(arb[2 * k], arb[2 * k + 1]);
}
void query(int k, int left, int right, int Qleft, int Qright)
{
    if(Qleft <= left && Qright >= right)
    {
        ///int este inclus
        maxim = max(maxim, arb[k]);
        return;
    }
    if(Qleft > right || Qright < left)
    {
        ///int nu se intersecteaza
        return;
    }
    int mid = (left + right) / 2;
    query(2 * k, left, mid, Qleft, Qright);
    query(2 * k + 1, mid + 1, right, Qleft, Qright);
}
void citire()
{
    fin>>N>>M;
    for(int i=1; i<=N; i++)
    {
        fin>>v[i];
    }
    build(1, 1, N);
    for(int i=1; i<=M; i++)
    {
        fin>>cer>>a>>b;
        if(cer == 0)
        {
            maxim = 0;
            query(1, 1, N, a, b);
            fout<<maxim<<"\n";
        }
        else
        {
            update(1, 1, N, a, b);
        }
    }
}
int main()
{
    citire();
    return 0;
}