#include <fstream>

#define Nmax 100001

using namespace std;

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

int n, m, i, op, x, y, arb[4 * Nmax];

void Update (int nod, int st, int dr, int a, int b, int val)
{
    if (dr < a || st > b)
        return;
    if (st >= a && dr <= b)
        arb[nod] = val;
    else
    {
        int mij = (st + dr) / 2;
        Update (nod * 2, st, mij, a, b, val);
        Update (nod * 2 + 1, mij + 1, dr, a, b, val);
        arb[nod] = max (arb[nod * 2], arb[nod * 2 + 1]);
    }

}

int Query (int nod, int st, int dr, int a, int b)
{
    if (dr < a || st > b)
        return 0;
    if (st >= a && dr <= b)
        return arb[nod];
    else
    {
        int mij = (st + dr) / 2;
        return max (Query (nod * 2, st, mij, a, b), Query (nod * 2 + 1, mij + 1, dr, a, b));

    }
}

int main()
{
    fin >> n >> m;
    for (i = 1; i <= n; i ++)
    {
        fin >> x;
        Update (1, 1, n, i, i, x);
    }

    for (i = 1; i <= m; i ++)
    {
        fin >> op;
        fin >> x >> y;
        if (op == 1)
            Update (1, 1, n, x, x, y);
        else
            fout << Query (1, 1, n, x, y) << '\n';
    }

    fin.close();
    fout.close();
    return 0;
}