#include <stdio.h>
#include <algorithm>
#define nmax 100001

using namespace std;

int arb[3 * nmax + 66], start, finish, pos, val, maxim;

void query (int nod, int left, int right) {
    if (start <= left && right <= finish) {
        if (maxim < arb[nod]) maxim = arb[nod];
        return;
    }

    int div = (left + right) / 2;
    if (start <= div) query (2*nod, left, div);
    if (div < finish) query (2*nod + 1, div + 1, right);
}

void update (int nod, int left, int right) {
    if (left == right) {
        arb[nod] = val;
        return;
    }

    int div = (left + right) / 2;
    if (pos <= div) update (2*nod, left, div);
    else update (2*nod + 1, div + 1, left);

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

int main() {
    freopen ("arbint.in", "r", stdin);
    freopen ("arbint.out", "w", stdout);
    int N, M, x, y, opt, i;
    scanf ("%d %d", &N, &M);
    for (i = 1; i <= N; ++i) {
        scanf ("%d", &x);
        val = x, pos = i;
        update (1, 1, N);
    }
    for (i = 1; i <= M; ++i) {
        scanf ("%d %d %d", &opt, &x, &y);
        if (opt == 0) {
            start = x, finish = y, maxim = -1;
            query (1, 1, N);
            printf ("%d\n", maxim);
        }
        if (opt == 1) {
            val = y, pos = x;
            update (1, 1, N);
        }
    }
    return 0;
}