#include <fstream>

using namespace std;

const int INF = 0x3f3f3f3f;
const int MAX = 100002;

int n, m, val, poz, start, stop, maxim;
int arb[4 * MAX + 50];

void update(int nod, int left, int right)
{
    if(left == right)
    {
        arb[nod] = val;
        return;
    }
    int mij = (left + right) >> 1;
    if(poz <= mij) update(2 * nod, left, mij);
    else update(2 * nod + 1, mij + 1, right);
    arb[nod] = max(arb[2 * nod], arb[2 * nod + 1]);
}

void query(int nod, int left, int right)
{
    if(start <= left && right <= stop)
    {
        maxim = max(maxim, arb[nod]);
        return;
    }
    int mij = (left + right) >> 1;
    if(start <= mij) query(2 * nod, left, mij);
    if(mij < stop) query(2 * nod + 1, mij + 1, right);
}

int main()
{
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);
    int x, a, b;
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; i++)
    {
        scanf("%d", &val); poz = i;
        update(1, 1, n);
    }
    for(int i = 1; i <= m; i++)
    {
        scanf("%d %d %d", &x, &a, &b);
        if(!x)
        {
            start = a; stop = b; maxim = -INF;
            query(1, 1, n);
            printf("%d\n", maxim);
        }
        else
        {
            poz = a; val = b;
            update(1, 1, n);
        }
    }
    return 0;
}