#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

const int Nmax = 100005;

vector <int> MaxArb(Nmax);

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

    int mij = (st + dr) / 2;

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

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

void Query (int &maxim, int Start, int Final, int nod, int st, int dr)
{
    if (st >= Start && dr <= Final)
    {
        maxim = max (maxim, MaxArb[nod]);
        return;
    }

    int mij = (st + dr) / 2;

    if (Start <= mij) Query (maxim, Start, Final, nod * 2, st, mij);
    if (Final > mij)  Query (maxim, Start, Final, nod * 2 + 1, mij + 1, dr);
}

int main()
{
    int n, m;
    in >> n >> m;

    for (int i = 1; i <= n; i++)
    {
        int x;
        in >> x;

        Update (i, x, 1, 1, n);
    }

    for (int i = 1; i <= m; i++)
    {
        int op, a, b;
        in >> op >> a >> b;

        if (op == 1)
            Update (a, b, 1, 1, n);

        else

        {
            int maxim = -1;
            Query (maxim, a, b, 1, 1, n);

            out << maxim << '\n';
        }
    }

    return 0;
}