#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <algorithm>

using namespace std;

int arb[1000001];

void arbint_update(int nod, int st, int dr, int poz, int val)
{
    if (st == dr) arb[nod] = val;
    else
    {
        int mij = (st + dr) / 2;
        if (poz <= mij)
            arbint_update(nod * 2, st, mij, poz, val);
        else
            arbint_update(nod * 2 + 1, mij + 1, dr, poz, val);
        arb[nod] = max(arb[nod * 2], arb[nod * 2 + 1]);
    }
}

int arbint_max(int nod, int st, int dr, int left, int right)
{
    if (left <= st && dr <= right)
        return arb[nod];
    int mij = (st + dr) / 2, s = 0;
    if (left <= mij)
        s = max(s, arbint_max(nod * 2, st, mij, left, right));
    if (mij<right)
        s = max(s, arbint_max(nod * 2 + 1, mij + 1, dr, left, right));
    return s;
}

int main()
{
    FILE *f = fopen("arbint.in", "r");
    FILE *g = fopen("arbint.out", "w");
    int n, m, tip, a, b;
    fscanf(f,"%d%d", &n, &m);
    for (int i = 1; i <= n; i++)
    {
        fscanf(f,"%d", &a);
        arbint_update(1, 1, n, i, a);
    }
    for (int i = 1; i <= m; i++)
    {
        fscanf(f,"%d%d%d", &tip, &a, &b);
        if (tip == 0)
            fprintf(g,"%d\n", arbint_max(1, 1, n, a, b));
        else
            arbint_update(1, 1, n, a, b);
    }
    return 0;
}