#include <fstream>

const int NMAX = 100005;

using namespace std;

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

int N,M,X,A,B,start,finish,Val,maxim,Pos,MaxArb[4*NMAX];

int Maxim (int a, int b)
{
    if (a>b) return a;
    return b;
}

void Update(int nod, int left, int right)
{
    int mid;

    if (left == right)
    {
        MaxArb[nod] = Val;
        return;
    }

    mid = (left+right)/2;
    if (Pos <= mid)
        Update(2*nod,left,mid);
    else Update(2*nod+1,mid+1,right);

    MaxArb[nod] = Maxim(MaxArb[2*nod],MaxArb[2*nod+1]);
}

void Query(int nod, int left, int right)
{
    int mid;

    if (start <= left && finish >= right)
    {
        maxim = Maxim(maxim, MaxArb[nod]);
        return;
    }

    mid = (left+right)/2;
    if (start <= mid)
        Query(2*nod,left,mid);
    if (mid+1 <= finish)
        Query(2*nod+1,mid+1,right);
}

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