#include <fstream>
using namespace std;

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

const int NMAX = 100001;

int N, M, MaxArb[4 * NMAX + 66];
int start, finish, val, poz, maxx;

void Update(int nod, int p, int u)
{
    if(p == u)
    {
        MaxArb[nod] = val;
        return;
    }
    int m = (p + u) / 2;
    if(poz <= m)
        Update(2 * nod, p, m);
    else
        Update(2 * nod + 1, m + 1, u);
    MaxArb[nod] = max(MaxArb[2 * nod], MaxArb[2 * nod + 1]);
}

void Query(int nod, int p, int u)
{
    if(start <= p && u <= finish)
    {
        if(maxx < MaxArb[nod])
            maxx = MaxArb[nod];
        return;
    }
    int m = (p + u) / 2;
    if(start <= m)
        Query(2 * nod, p, m);
    if(m < finish)
        Query(2 * nod + 1, m + 1, u);
}

int main()
{
    f >> N >> M;
    for(int i = 1; i <= N; i++)
    {
        int X;
        f >> X;
        poz = i;
        val = X;
        Update(1, 1, N);
    }
    for(int i = 1; i <= M; i++)
    {
        int X, A, B;
        f >> X >> A >> B;
        if(X == 0)
        {
            maxx = -1;
            start = A, finish = B;
            Query(1, 1, N);
            g << maxx << '\n';
        }
        else
        {
            poz = A, val = B;
            Update(1, 1, N);
        }
    }
    return 0;
}