#include <fstream>

using namespace std;

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

int p, x, arb[400000], n, m, mx;

void upd (int nod, int left, int right )
{
    int middle = (left + right)/2;
    if(left == right)
    {
        arb[nod] = x;
        return ;
    }
    else
    {
        if (p<=middle)
            upd (2*nod, left, middle);
        else
            upd (2*nod + 1, middle + 1, right);
    }
    arb[nod] = max(arb[nod*2], arb[nod*2+1]);
}

void qry (int nod, int left, int right, int st, int dr)
{
    int middle = (right + left)/2;
    if (left > dr || right < st)
        return;
    else
    {
        if (left <= st && dr <= right)
        {
            mx = max (mx, arb[nod]);
            return;
        }
        qry(2*nod, left, middle, st, dr);
        qry(2*nod + 1, middle + 1, right, st, dr);

    }
}

int main()
{
    int q, a, b;
    fin >> n >> m;
    for (int i=1; i<=n; i++)
    {
        fin >> x;
        p = i;
        upd (1, 1, n);
    }
    for (int i=1; i<=m; i++)
    {
        fin >> q >> a >> b;
        p=a; x = b;
        if (q == 1)
        {
            upd(1, 1, n);
        }
        else
        {
            mx = 0;
            qry(1, 1, n, a, b);
            fout << mx << '\n';
        }
    }
    return 0;
}